./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4d014703 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_byte_cursor_from_array_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 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 13:06:28,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 13:06:28,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 13:06:28,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 13:06:28,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 13:06:28,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 13:06:28,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 13:06:28,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 13:06:28,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 13:06:28,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 13:06:28,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 13:06:28,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 13:06:28,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 13:06:28,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 13:06:28,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 13:06:28,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 13:06:28,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 13:06:28,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 13:06:28,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 13:06:28,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 13:06:28,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 13:06:28,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 13:06:28,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 13:06:28,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 13:06:28,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 13:06:28,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 13:06:28,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 13:06:28,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 13:06:28,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 13:06:28,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 13:06:28,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 13:06:28,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 13:06:28,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 13:06:28,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 13:06:28,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 13:06:28,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 13:06:28,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 13:06:28,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 13:06:28,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 13:06:28,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 13:06:28,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 13:06:28,854 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-02 13:06:28,874 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 13:06:28,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 13:06:28,875 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 13:06:28,875 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 13:06:28,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 13:06:28,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 13:06:28,876 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 13:06:28,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 13:06:28,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 13:06:28,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 13:06:28,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 13:06:28,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 13:06:28,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 13:06:28,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 13:06:28,878 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 13:06:28,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 13:06:28,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 13:06:28,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 13:06:28,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 13:06:28,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 13:06:28,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 13:06:28,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 13:06:28,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 13:06:28,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 13:06:28,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 13:06:28,880 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 13:06:28,880 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 13:06:28,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 13:06:28,882 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 13:06:28,882 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 -> 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c [2021-11-02 13:06:29,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 13:06:29,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 13:06:29,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 13:06:29,093 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 13:06:29,094 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 13:06:29,095 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2021-11-02 13:06:29,141 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9d6568ba/cb006130b9244c969ed72bb597416a27/FLAGb5cc68fb1 [2021-11-02 13:06:29,850 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 13:06:29,851 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2021-11-02 13:06:29,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9d6568ba/cb006130b9244c969ed72bb597416a27/FLAGb5cc68fb1 [2021-11-02 13:06:30,122 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9d6568ba/cb006130b9244c969ed72bb597416a27 [2021-11-02 13:06:30,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 13:06:30,128 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 13:06:30,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 13:06:30,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 13:06:30,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 13:06:30,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 01:06:30" (1/1) ... [2021-11-02 13:06:30,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f972d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:06:30, skipping insertion in model container [2021-11-02 13:06:30,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 01:06:30" (1/1) ... [2021-11-02 13:06:30,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 13:06:30,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 13:06:30,423 WARN L228 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_byte_cursor_from_array_harness.i[4500,4513] [2021-11-02 13:06:30,432 WARN L228 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_byte_cursor_from_array_harness.i[4560,4573] [2021-11-02 13:06:30,456 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 13:06:30,464 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 13:06:31,022 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,023 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,024 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,025 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,025 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,041 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,043 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,046 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,046 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,270 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 13:06:31,271 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 13:06:31,272 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 13:06:31,272 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 13:06:31,273 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 13:06:31,273 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 13:06:31,274 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 13:06:31,274 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 13:06:31,274 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 13:06:31,275 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 13:06:31,364 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 13:06:31,431 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,431 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 13:06:31,528 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 13:06:31,536 WARN L228 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_byte_cursor_from_array_harness.i[4500,4513] [2021-11-02 13:06:31,537 WARN L228 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_byte_cursor_from_array_harness.i[4560,4573] [2021-11-02 13:06:31,538 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 13:06:31,538 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 13:06:31,558 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,559 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,560 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,560 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,561 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,565 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,568 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,569 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,571 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,598 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 13:06:31,598 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 13:06:31,599 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 13:06:31,599 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 13:06:31,600 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 13:06:31,600 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 13:06:31,601 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 13:06:31,601 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 13:06:31,601 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 13:06:31,602 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 13:06:31,621 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 13:06:31,700 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,700 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:06:31,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 13:06:31,886 INFO L208 MainTranslator]: Completed translation [2021-11-02 13:06:31,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:06:31 WrapperNode [2021-11-02 13:06:31,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 13:06:31,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 13:06:31,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 13:06:31,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 13:06:31,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:06:31" (1/1) ... [2021-11-02 13:06:31,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:06:31" (1/1) ... [2021-11-02 13:06:32,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 13:06:32,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 13:06:32,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 13:06:32,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 13:06:32,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:06:31" (1/1) ... [2021-11-02 13:06:32,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:06:31" (1/1) ... [2021-11-02 13:06:32,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:06:31" (1/1) ... [2021-11-02 13:06:32,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:06:31" (1/1) ... [2021-11-02 13:06:32,142 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:06:31" (1/1) ... [2021-11-02 13:06:32,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:06:31" (1/1) ... [2021-11-02 13:06:32,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:06:31" (1/1) ... [2021-11-02 13:06:32,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 13:06:32,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 13:06:32,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 13:06:32,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 13:06:32,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:06:31" (1/1) ... [2021-11-02 13:06:32,170 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 13:06:32,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:06:32,187 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-11-02 13:06:32,203 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-11-02 13:06:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 13:06:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 13:06:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 13:06:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 13:06:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 13:06:32,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 13:06:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 13:06:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 13:06:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 13:06:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 13:06:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 13:06:36,910 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 13:06:36,911 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2021-11-02 13:06:36,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:06:36 BoogieIcfgContainer [2021-11-02 13:06:36,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 13:06:36,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 13:06:36,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 13:06:36,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 13:06:36,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 01:06:30" (1/3) ... [2021-11-02 13:06:36,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74db5514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 01:06:36, skipping insertion in model container [2021-11-02 13:06:36,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:06:31" (2/3) ... [2021-11-02 13:06:36,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74db5514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 01:06:36, skipping insertion in model container [2021-11-02 13:06:36,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:06:36" (3/3) ... [2021-11-02 13:06:36,923 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_array_harness.i [2021-11-02 13:06:36,927 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 13:06:36,927 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-02 13:06:36,964 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 13:06:36,968 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-11-02 13:06:36,969 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-02 13:06:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 54 states have (on average 1.462962962962963) internal successors, (79), 59 states have internal predecessors, (79), 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-11-02 13:06:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-02 13:06:36,998 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:06:36,999 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:06:36,999 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:06:37,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:06:37,002 INFO L85 PathProgramCache]: Analyzing trace with hash -86834800, now seen corresponding path program 1 times [2021-11-02 13:06:37,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:06:37,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898164638] [2021-11-02 13:06:37,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:06:37,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:06:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:06:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:06:37,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:06:37,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898164638] [2021-11-02 13:06:37,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898164638] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:06:37,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:06:37,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 13:06:37,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222542791] [2021-11-02 13:06:37,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 13:06:37,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:06:37,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 13:06:37,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 13:06:37,674 INFO L87 Difference]: Start difference. First operand has 60 states, 54 states have (on average 1.462962962962963) internal successors, (79), 59 states have internal predecessors, (79), 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) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-11-02 13:06:39,811 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:06:40,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:06:40,317 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2021-11-02 13:06:40,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 13:06:40,319 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) Word has length 12 [2021-11-02 13:06:40,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:06:40,326 INFO L225 Difference]: With dead ends: 117 [2021-11-02 13:06:40,326 INFO L226 Difference]: Without dead ends: 53 [2021-11-02 13:06:40,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.05ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 13:06:40,331 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2368.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.38ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2604.70ms IncrementalHoareTripleChecker+Time [2021-11-02 13:06:40,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 71 Unknown, 0 Unchecked, 1.38ms Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 1 Unknown, 0 Unchecked, 2604.70ms Time] [2021-11-02 13:06:40,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-02 13:06:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-11-02 13:06:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 52 states have internal predecessors, (62), 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-11-02 13:06:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2021-11-02 13:06:40,358 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 12 [2021-11-02 13:06:40,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:06:40,359 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2021-11-02 13:06:40,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-11-02 13:06:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2021-11-02 13:06:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-02 13:06:40,360 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:06:40,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:06:40,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 13:06:40,361 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:06:40,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:06:40,362 INFO L85 PathProgramCache]: Analyzing trace with hash -479861810, now seen corresponding path program 1 times [2021-11-02 13:06:40,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:06:40,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759557655] [2021-11-02 13:06:40,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:06:40,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:06:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:06:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:06:40,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:06:40,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759557655] [2021-11-02 13:06:40,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759557655] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:06:40,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:06:40,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 13:06:40,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407585280] [2021-11-02 13:06:40,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 13:06:40,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:06:40,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 13:06:40,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 13:06:40,634 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-02 13:06:42,701 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:06:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:06:43,329 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2021-11-02 13:06:43,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 13:06:43,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2021-11-02 13:06:43,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:06:43,330 INFO L225 Difference]: With dead ends: 90 [2021-11-02 13:06:43,330 INFO L226 Difference]: Without dead ends: 53 [2021-11-02 13:06:43,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.49ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 13:06:43,331 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2421.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.64ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2670.26ms IncrementalHoareTripleChecker+Time [2021-11-02 13:06:43,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 97 Unknown, 0 Unchecked, 2.64ms Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 1 Unknown, 0 Unchecked, 2670.26ms Time] [2021-11-02 13:06:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-02 13:06:43,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-11-02 13:06:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 52 states have internal predecessors, (61), 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-11-02 13:06:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2021-11-02 13:06:43,335 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 12 [2021-11-02 13:06:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:06:43,336 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2021-11-02 13:06:43,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-02 13:06:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2021-11-02 13:06:43,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-02 13:06:43,336 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:06:43,336 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:06:43,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 13:06:43,337 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:06:43,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:06:43,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1018024457, now seen corresponding path program 1 times [2021-11-02 13:06:43,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:06:43,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091246330] [2021-11-02 13:06:43,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:06:43,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:06:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:06:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:06:43,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:06:43,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091246330] [2021-11-02 13:06:43,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091246330] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:06:43,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:06:43,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 13:06:43,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966498417] [2021-11-02 13:06:43,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 13:06:43,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:06:43,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 13:06:43,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 13:06:43,959 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-11-02 13:06:46,012 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:06:47,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:06:47,544 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2021-11-02 13:06:47,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 13:06:47,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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) Word has length 14 [2021-11-02 13:06:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:06:47,545 INFO L225 Difference]: With dead ends: 97 [2021-11-02 13:06:47,546 INFO L226 Difference]: Without dead ends: 93 [2021-11-02 13:06:47,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 283.16ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-02 13:06:47,547 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3152.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.42ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3369.92ms IncrementalHoareTripleChecker+Time [2021-11-02 13:06:47,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 361 Unknown, 0 Unchecked, 9.42ms Time], IncrementalHoareTripleChecker [17 Valid, 343 Invalid, 1 Unknown, 0 Unchecked, 3369.92ms Time] [2021-11-02 13:06:47,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-02 13:06:47,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 61. [2021-11-02 13:06:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 60 states have internal predecessors, (69), 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-11-02 13:06:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2021-11-02 13:06:47,559 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 14 [2021-11-02 13:06:47,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:06:47,560 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2021-11-02 13:06:47,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-11-02 13:06:47,560 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2021-11-02 13:06:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-02 13:06:47,561 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:06:47,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:06:47,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 13:06:47,561 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:06:47,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:06:47,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1084310207, now seen corresponding path program 1 times [2021-11-02 13:06:47,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:06:47,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515351636] [2021-11-02 13:06:47,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:06:47,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:06:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:06:49,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:06:49,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:06:49,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515351636] [2021-11-02 13:06:49,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515351636] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:06:49,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:06:49,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 13:06:49,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849220313] [2021-11-02 13:06:49,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 13:06:49,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:06:49,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 13:06:49,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 13:06:49,676 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-11-02 13:06:51,730 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:06:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:06:53,064 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2021-11-02 13:06:53,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 13:06:53,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) Word has length 18 [2021-11-02 13:06:53,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:06:53,065 INFO L225 Difference]: With dead ends: 111 [2021-11-02 13:06:53,065 INFO L226 Difference]: Without dead ends: 68 [2021-11-02 13:06:53,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 416.32ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-11-02 13:06:53,066 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2818.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.47ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3069.16ms IncrementalHoareTripleChecker+Time [2021-11-02 13:06:53,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 230 Unknown, 0 Unchecked, 6.47ms Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 1 Unknown, 0 Unchecked, 3069.16ms Time] [2021-11-02 13:06:53,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-02 13:06:53,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2021-11-02 13:06:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 62 states have internal predecessors, (71), 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-11-02 13:06:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2021-11-02 13:06:53,071 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 18 [2021-11-02 13:06:53,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:06:53,072 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2021-11-02 13:06:53,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-11-02 13:06:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2021-11-02 13:06:53,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-02 13:06:53,072 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:06:53,072 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:06:53,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 13:06:53,073 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:06:53,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:06:53,073 INFO L85 PathProgramCache]: Analyzing trace with hash -404251837, now seen corresponding path program 1 times [2021-11-02 13:06:53,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:06:53,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948978104] [2021-11-02 13:06:53,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:06:53,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:06:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 13:06:55,638 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 13:06:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 13:06:58,280 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 13:06:58,281 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-02 13:06:58,282 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-11-02 13:06:58,283 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-11-02 13:06:58,284 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-11-02 13:06:58,284 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-11-02 13:06:58,284 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-11-02 13:06:58,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 13:06:58,288 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2021-11-02 13:06:58,291 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 13:06:58,313 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,314 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 13:06:58,314 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,314 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 13:06:58,318 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,319 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 13:06:58,327 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 13:06:58,330 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,330 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 13:06:58,330 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,330 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 13:06:58,330 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,331 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 13:06:58,331 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,331 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 13:06:58,332 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,332 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 13:06:58,332 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,332 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 13:06:58,332 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,333 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 13:06:58,333 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,333 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 13:06:58,333 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 13:06:58,334 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 13:06:58,335 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,335 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 13:06:58,335 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,335 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 13:06:58,336 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 13:06:58,336 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 13:06:58,337 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,337 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 13:06:58,337 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,337 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 13:06:58,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,338 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 13:06:58,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,338 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 13:06:58,339 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,339 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 13:06:58,340 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,340 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 13:06:58,340 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,340 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 13:06:58,340 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,341 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 13:06:58,341 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,341 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 13:06:58,341 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,342 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 13:06:58,342 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,342 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 13:06:58,342 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,342 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 13:06:58,343 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 13:06:58,343 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 13:06:58,344 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,344 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 13:06:58,345 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,345 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 13:06:58,346 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,346 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 13:06:58,346 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,347 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 13:06:58,348 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,348 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 13:06:58,348 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,348 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 13:06:58,348 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,349 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 13:06:58,349 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,349 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 13:06:58,350 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,350 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 13:06:58,350 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,350 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 13:06:58,350 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,351 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 13:06:58,351 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,351 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 13:06:58,352 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,352 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 13:06:58,352 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,352 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 13:06:58,352 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,353 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 13:06:58,353 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,353 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 13:06:58,353 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,353 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 13:06:58,354 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,355 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 13:06:58,356 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,356 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 13:06:58,356 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,357 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 13:06:58,357 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,357 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 13:06:58,357 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,357 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 13:06:58,360 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,360 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 13:06:58,360 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,360 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 13:06:58,361 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,361 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 13:06:58,361 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 13:06:58,362 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 13:06:58,363 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,363 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 13:06:58,363 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,363 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 13:06:58,363 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,364 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 13:06:58,364 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,364 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 13:06:58,364 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,365 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 13:06:58,370 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,371 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 13:06:58,371 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,371 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 13:06:58,372 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,372 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 13:06:58,372 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,373 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 13:06:58,374 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,374 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base [2021-11-02 13:06:58,376 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,377 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base [2021-11-02 13:06:58,377 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled [2021-11-02 13:06:58,377 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset [2021-11-02 13:06:58,378 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled [2021-11-02 13:06:58,378 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset [2021-11-02 13:06:58,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 01:06:58 BoogieIcfgContainer [2021-11-02 13:06:58,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 13:06:58,492 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 13:06:58,492 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 13:06:58,492 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 13:06:58,492 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:06:36" (3/4) ... [2021-11-02 13:06:58,495 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-02 13:06:58,495 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 13:06:58,496 INFO L158 Benchmark]: Toolchain (without parser) took 28367.96ms. Allocated memory was 98.6MB in the beginning and 866.1MB in the end (delta: 767.6MB). Free memory was 64.3MB in the beginning and 616.7MB in the end (delta: -552.3MB). Peak memory consumption was 213.3MB. Max. memory is 16.1GB. [2021-11-02 13:06:58,496 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 56.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 13:06:58,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1756.08ms. Allocated memory was 98.6MB in the beginning and 142.6MB in the end (delta: 44.0MB). Free memory was 64.1MB in the beginning and 62.8MB in the end (delta: 1.3MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. [2021-11-02 13:06:58,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 154.73ms. Allocated memory is still 142.6MB. Free memory was 62.8MB in the beginning and 51.0MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-02 13:06:58,498 INFO L158 Benchmark]: Boogie Preprocessor took 119.67ms. Allocated memory is still 142.6MB. Free memory was 51.0MB in the beginning and 86.2MB in the end (delta: -35.2MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2021-11-02 13:06:58,498 INFO L158 Benchmark]: RCFGBuilder took 4749.15ms. Allocated memory was 142.6MB in the beginning and 499.1MB in the end (delta: 356.5MB). Free memory was 86.2MB in the beginning and 351.3MB in the end (delta: -265.2MB). Peak memory consumption was 297.4MB. Max. memory is 16.1GB. [2021-11-02 13:06:58,498 INFO L158 Benchmark]: TraceAbstraction took 21576.85ms. Allocated memory was 499.1MB in the beginning and 866.1MB in the end (delta: 367.0MB). Free memory was 351.3MB in the beginning and 617.7MB in the end (delta: -266.4MB). Peak memory consumption was 426.5MB. Max. memory is 16.1GB. [2021-11-02 13:06:58,498 INFO L158 Benchmark]: Witness Printer took 3.41ms. Allocated memory is still 866.1MB. Free memory is still 616.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 13:06:58,500 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.14ms. Allocated memory is still 98.6MB. Free memory is still 56.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1756.08ms. Allocated memory was 98.6MB in the beginning and 142.6MB in the end (delta: 44.0MB). Free memory was 64.1MB in the beginning and 62.8MB in the end (delta: 1.3MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 154.73ms. Allocated memory is still 142.6MB. Free memory was 62.8MB in the beginning and 51.0MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.67ms. Allocated memory is still 142.6MB. Free memory was 51.0MB in the beginning and 86.2MB in the end (delta: -35.2MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * RCFGBuilder took 4749.15ms. Allocated memory was 142.6MB in the beginning and 499.1MB in the end (delta: 356.5MB). Free memory was 86.2MB in the beginning and 351.3MB in the end (delta: -265.2MB). Peak memory consumption was 297.4MB. Max. memory is 16.1GB. * TraceAbstraction took 21576.85ms. Allocated memory was 499.1MB in the beginning and 866.1MB in the end (delta: 367.0MB). Free memory was 351.3MB in the beginning and 617.7MB in the end (delta: -266.4MB). Peak memory consumption was 426.5MB. Max. memory is 16.1GB. * Witness Printer took 3.41ms. Allocated memory is still 866.1MB. Free memory is still 616.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_common_log_subject_list~0 : { subject_list : $Pointer$, count : int }; and expression ~s_common_log_subject_list~0.subject_list.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~s_list~0 : { error_list : $Pointer$, count : ~uint16_t~0 }; and expression ~s_list~0.error_list.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 8772. Possible FailurePath: [L6866-L6871] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7311] static __thread int tl_last_error = 0; [L7648-L7660] static const uint8_t s_tolower_table[256] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 91, 92, 93, 94, 95, 96, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255}; [L8771-L8919] static struct aws_error_info errors[] = { [(AWS_ERROR_SUCCESS)-0x0000] = { .literal_name = "AWS_ERROR_SUCCESS", .error_code = (AWS_ERROR_SUCCESS), .error_str = ("Success."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SUCCESS" ", " "Success.", } , [(AWS_ERROR_OOM)-0x0000] = { .literal_name = "AWS_ERROR_OOM", .error_code = (AWS_ERROR_OOM), .error_str = ("Out of memory."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OOM" ", " "Out of memory.", } , [(AWS_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_UNKNOWN", .error_code = (AWS_ERROR_UNKNOWN), .error_str = ("Unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNKNOWN" ", " "Unknown error.", } , [(AWS_ERROR_SHORT_BUFFER)-0x0000] = { .literal_name = "AWS_ERROR_SHORT_BUFFER", .error_code = (AWS_ERROR_SHORT_BUFFER), .error_str = ("Buffer is not large enough to hold result."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SHORT_BUFFER" ", " "Buffer is not large enough to hold result.", } , [(AWS_ERROR_OVERFLOW_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_OVERFLOW_DETECTED", .error_code = (AWS_ERROR_OVERFLOW_DETECTED), .error_str = ("Fixed size value overflow was detected."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_OVERFLOW_DETECTED" ", " "Fixed size value overflow was detected.", } , [(AWS_ERROR_UNSUPPORTED_OPERATION)-0x0000] = { .literal_name = "AWS_ERROR_UNSUPPORTED_OPERATION", .error_code = (AWS_ERROR_UNSUPPORTED_OPERATION), .error_str = ("Unsupported operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNSUPPORTED_OPERATION" ", " "Unsupported operation.", } , [(AWS_ERROR_INVALID_BUFFER_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BUFFER_SIZE", .error_code = (AWS_ERROR_INVALID_BUFFER_SIZE), .error_str = ("Invalid buffer size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BUFFER_SIZE" ", " "Invalid buffer size.", } , [(AWS_ERROR_INVALID_HEX_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_HEX_STR", .error_code = (AWS_ERROR_INVALID_HEX_STR), .error_str = ("Invalid hex string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_HEX_STR" ", " "Invalid hex string.", } , [(AWS_ERROR_INVALID_BASE64_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_BASE64_STR", .error_code = (AWS_ERROR_INVALID_BASE64_STR), .error_str = ("Invalid base64 string."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_BASE64_STR" ", " "Invalid base64 string.", } , [(AWS_ERROR_INVALID_INDEX)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_INDEX", .error_code = (AWS_ERROR_INVALID_INDEX), .error_str = ("Invalid index for list access."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_INDEX" ", " "Invalid index for list access.", } , [(AWS_ERROR_THREAD_INVALID_SETTINGS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INVALID_SETTINGS", .error_code = (AWS_ERROR_THREAD_INVALID_SETTINGS), .error_str = ("Invalid thread settings."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INVALID_SETTINGS" ", " "Invalid thread settings.", } , [(AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE", .error_code = (AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE), .error_str = ("Insufficent resources for thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_INSUFFICIENT_RESOURCE" ", " "Insufficent resources for thread.", } , [(AWS_ERROR_THREAD_NO_PERMISSIONS)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_PERMISSIONS", .error_code = (AWS_ERROR_THREAD_NO_PERMISSIONS), .error_str = ("Insufficient permissions for thread operation."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_PERMISSIONS" ", " "Insufficient permissions for thread operation.", } , [(AWS_ERROR_THREAD_NOT_JOINABLE)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NOT_JOINABLE", .error_code = (AWS_ERROR_THREAD_NOT_JOINABLE), .error_str = ("Thread not joinable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NOT_JOINABLE" ", " "Thread not joinable.", } , [(AWS_ERROR_THREAD_NO_SUCH_THREAD_ID)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID", .error_code = (AWS_ERROR_THREAD_NO_SUCH_THREAD_ID), .error_str = ("No such thread ID."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_NO_SUCH_THREAD_ID" ", " "No such thread ID.", } , [(AWS_ERROR_THREAD_DEADLOCK_DETECTED)-0x0000] = { .literal_name = "AWS_ERROR_THREAD_DEADLOCK_DETECTED", .error_code = (AWS_ERROR_THREAD_DEADLOCK_DETECTED), .error_str = ("Deadlock detected in thread."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_THREAD_DEADLOCK_DETECTED" ", " "Deadlock detected in thread.", } , [(AWS_ERROR_MUTEX_NOT_INIT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_NOT_INIT", .error_code = (AWS_ERROR_MUTEX_NOT_INIT), .error_str = ("Mutex not initialized."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_NOT_INIT" ", " "Mutex not initialized.", } , [(AWS_ERROR_MUTEX_TIMEOUT)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_TIMEOUT", .error_code = (AWS_ERROR_MUTEX_TIMEOUT), .error_str = ("Mutex operation timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_TIMEOUT" ", " "Mutex operation timed out.", } , [(AWS_ERROR_MUTEX_CALLER_NOT_OWNER)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_CALLER_NOT_OWNER", .error_code = (AWS_ERROR_MUTEX_CALLER_NOT_OWNER), .error_str = ("The caller of a mutex operation was not the owner."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_CALLER_NOT_OWNER" ", " "The caller of a mutex operation was not the owner.", } , [(AWS_ERROR_MUTEX_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_MUTEX_FAILED", .error_code = (AWS_ERROR_MUTEX_FAILED), .error_str = ("Mutex operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MUTEX_FAILED" ", " "Mutex operation failed.", } , [(AWS_ERROR_COND_VARIABLE_INIT_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_INIT_FAILED", .error_code = (AWS_ERROR_COND_VARIABLE_INIT_FAILED), .error_str = ("Condition variable initialization failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_INIT_FAILED" ", " "Condition variable initialization failed.", } , [(AWS_ERROR_COND_VARIABLE_TIMED_OUT)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_TIMED_OUT", .error_code = (AWS_ERROR_COND_VARIABLE_TIMED_OUT), .error_str = ("Condition variable wait timed out."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_TIMED_OUT" ", " "Condition variable wait timed out.", } , [(AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN)-0x0000] = { .literal_name = "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN", .error_code = (AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN), .error_str = ("Condition variable unknown error."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_COND_VARIABLE_ERROR_UNKNOWN" ", " "Condition variable unknown error.", } , [(AWS_ERROR_CLOCK_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_CLOCK_FAILURE", .error_code = (AWS_ERROR_CLOCK_FAILURE), .error_str = ("Clock operation failed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_CLOCK_FAILURE" ", " "Clock operation failed.", } , [(AWS_ERROR_LIST_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EMPTY", .error_code = (AWS_ERROR_LIST_EMPTY), .error_str = ("Empty list."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EMPTY" ", " "Empty list.", } , [(AWS_ERROR_DEST_COPY_TOO_SMALL)-0x0000] = { .literal_name = "AWS_ERROR_DEST_COPY_TOO_SMALL", .error_code = (AWS_ERROR_DEST_COPY_TOO_SMALL), .error_str = ("Destination of copy is too small."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_DEST_COPY_TOO_SMALL" ", " "Destination of copy is too small.", } , [(AWS_ERROR_LIST_EXCEEDS_MAX_SIZE)-0x0000] = { .literal_name = "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE", .error_code = (AWS_ERROR_LIST_EXCEEDS_MAX_SIZE), .error_str = ("A requested operation on a list would exceed it's max size."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_EXCEEDS_MAX_SIZE" ", " "A requested operation on a list would exceed it's max size.", } , [(AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK)-0x0000] = { .literal_name = "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK", .error_code = (AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK), .error_str = ("Attempt to shrink a list in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK" ", " "Attempt to shrink a list in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_FULL)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_FULL", .error_code = (AWS_ERROR_PRIORITY_QUEUE_FULL), .error_str = ("Attempt to add items to a full preallocated queue in static mode."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_FULL" ", " "Attempt to add items to a full preallocated queue in static mode.", } , [(AWS_ERROR_PRIORITY_QUEUE_EMPTY)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_EMPTY", .error_code = (AWS_ERROR_PRIORITY_QUEUE_EMPTY), .error_str = ("Attempt to pop an item from an empty queue."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_EMPTY" ", " "Attempt to pop an item from an empty queue.", } , [(AWS_ERROR_PRIORITY_QUEUE_BAD_NODE)-0x0000] = { .literal_name = "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE", .error_code = (AWS_ERROR_PRIORITY_QUEUE_BAD_NODE), .error_str = ("Bad node handle passed to remove."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_PRIORITY_QUEUE_BAD_NODE" ", " "Bad node handle passed to remove.", } , [(AWS_ERROR_HASHTBL_ITEM_NOT_FOUND)-0x0000] = { .literal_name = "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND", .error_code = (AWS_ERROR_HASHTBL_ITEM_NOT_FOUND), .error_str = ("Item not found in hash table."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_HASHTBL_ITEM_NOT_FOUND" ", " "Item not found in hash table.", } , [(AWS_ERROR_INVALID_DATE_STR)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_DATE_STR", .error_code = (AWS_ERROR_INVALID_DATE_STR), .error_str = ("Date string is invalid and cannot be parsed."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_DATE_STR" ", " "Date string is invalid and cannot be parsed.", } , [(AWS_ERROR_INVALID_ARGUMENT)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_ARGUMENT", .error_code = (AWS_ERROR_INVALID_ARGUMENT), .error_str = ("An invalid argument was passed to a function."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_ARGUMENT" ", " "An invalid argument was passed to a function.", } , [(AWS_ERROR_RANDOM_GEN_FAILED)-0x0000] = { .literal_name = "AWS_ERROR_RANDOM_GEN_FAILED", .error_code = (AWS_ERROR_RANDOM_GEN_FAILED), .error_str = ("A call to the random number generator failed. Retry later."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_RANDOM_GEN_FAILED" ", " "A call to the random number generator failed. Retry later.", } , [(AWS_ERROR_MALFORMED_INPUT_STRING)-0x0000] = { .literal_name = "AWS_ERROR_MALFORMED_INPUT_STRING", .error_code = (AWS_ERROR_MALFORMED_INPUT_STRING), .error_str = ("An input string was passed to a parser and the string was incorrectly formatted."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MALFORMED_INPUT_STRING" ", " "An input string was passed to a parser and the string was incorrectly formatted.", } , [(AWS_ERROR_UNIMPLEMENTED)-0x0000] = { .literal_name = "AWS_ERROR_UNIMPLEMENTED", .error_code = (AWS_ERROR_UNIMPLEMENTED), .error_str = ("A function was called, but is not implemented."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_UNIMPLEMENTED" ", " "A function was called, but is not implemented.", } , [(AWS_ERROR_INVALID_STATE)-0x0000] = { .literal_name = "AWS_ERROR_INVALID_STATE", .error_code = (AWS_ERROR_INVALID_STATE), .error_str = ("An invalid state was encountered."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_INVALID_STATE" ", " "An invalid state was encountered.", } , [(AWS_ERROR_ENVIRONMENT_GET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_GET", .error_code = (AWS_ERROR_ENVIRONMENT_GET), .error_str = ("System call failure when getting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_GET" ", " "System call failure when getting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_SET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_SET", .error_code = (AWS_ERROR_ENVIRONMENT_SET), .error_str = ("System call failure when setting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_SET" ", " "System call failure when setting an environment variable.", } , [(AWS_ERROR_ENVIRONMENT_UNSET)-0x0000] = { .literal_name = "AWS_ERROR_ENVIRONMENT_UNSET", .error_code = (AWS_ERROR_ENVIRONMENT_UNSET), .error_str = ("System call failure when unsetting an environment variable."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_ENVIRONMENT_UNSET" ", " "System call failure when unsetting an environment variable.", } , [(AWS_ERROR_SYS_CALL_FAILURE)-0x0000] = { .literal_name = "AWS_ERROR_SYS_CALL_FAILURE", .error_code = (AWS_ERROR_SYS_CALL_FAILURE), .error_str = ("System call failure"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_SYS_CALL_FAILURE" ", " "System call failure", } , [(AWS_ERROR_FILE_INVALID_PATH)-0x0000] = { .literal_name = "AWS_ERROR_FILE_INVALID_PATH", .error_code = (AWS_ERROR_FILE_INVALID_PATH), .error_str = ("Invalid file path."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_FILE_INVALID_PATH" ", " "Invalid file path.", } , [(AWS_ERROR_MAX_FDS_EXCEEDED)-0x0000] = { .literal_name = "AWS_ERROR_MAX_FDS_EXCEEDED", .error_code = (AWS_ERROR_MAX_FDS_EXCEEDED), .error_str = ("The maximum number of fds has been exceeded."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_MAX_FDS_EXCEEDED" ", " "The maximum number of fds has been exceeded.", } , [(AWS_ERROR_NO_PERMISSION)-0x0000] = { .literal_name = "AWS_ERROR_NO_PERMISSION", .error_code = (AWS_ERROR_NO_PERMISSION), .error_str = ("User does not have permission to perform the requested action."), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_NO_PERMISSION" ", " "User does not have permission to perform the requested action.", } , [(AWS_ERROR_STREAM_UNSEEKABLE)-0x0000] = { .literal_name = "AWS_ERROR_STREAM_UNSEEKABLE", .error_code = (AWS_ERROR_STREAM_UNSEEKABLE), .error_str = ("Stream does not support seek operations"), .lib_name = ("aws-c-common"), .formatted_name = "aws-c-common" ": " "AWS_ERROR_STREAM_UNSEEKABLE" ", " "Stream does not support seek operations", } , }; [L8922-L8925] static struct aws_error_info_list s_list = { .error_list = errors, .count = (sizeof(errors) / sizeof((errors)[0])), }; [L8927-L8936] static struct aws_log_subject_info s_common_log_subject_infos[] = { { .subject_id = (AWS_LS_COMMON_GENERAL), .subject_name = ("aws-c-common"), .subject_description = ("Subject for aws-c-common logging that doesn't belong to any particular category") } , { .subject_id = (AWS_LS_COMMON_TASK_SCHEDULER), .subject_name = ("task-scheduler"), .subject_description = ("Subject for task scheduler or task specific logging.") } , }; [L8938-L8941] static struct aws_log_subject_info_list s_common_log_subject_list = { .subject_list = s_common_log_subject_infos, .count = (sizeof(s_common_log_subject_infos) / sizeof((s_common_log_subject_infos)[0])), }; [L8943-L8947] static _Bool s_common_library_initialized = 0 ; VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list=2, s_common_log_subject_list={393:0}, s_list=46, s_list={484:0}, s_tolower_table={455:0}, tl_last_error=0] [L8961] size_t length; [L211] COND FALSE !(!cond) VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list={393:0}, s_common_log_subject_list=2, s_list={484:0}, s_list=46, s_tolower_table={455:0}, tl_last_error=0] [L6886] return malloc(size); [L8962] uint8_t *array = bounded_malloc(length); [L8965] struct aws_byte_cursor cur = aws_byte_cursor_from_array(array, length); [L211] COND FALSE !(!cond) VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list=2, s_common_log_subject_list={393:0}, s_list=46, s_list={484:0}, s_tolower_table={455:0}, tl_last_error=0] [L8253] struct aws_byte_cursor cur; [L8254] cur.ptr = (uint8_t *)bytes [L8255] cur.len = len [L7386-L7387] EXPR cursor && ((cursor->len == 0) || (cursor->len > 0 && cursor->ptr && ((((cursor->len)) == 0) || ((cursor->ptr))))) [L7387] EXPR cursor->len [L7387] EXPR (cursor->len == 0) || (cursor->len > 0 && cursor->ptr && ((((cursor->len)) == 0) || ((cursor->ptr)))) [L7387] EXPR cursor->len [L7387] EXPR cursor->len > 0 && cursor->ptr VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list={393:0}, s_common_log_subject_list=2, s_list={484:0}, s_list=46, s_tolower_table={455:0}, tl_last_error=0] [L7387] EXPR cursor->len > 0 && cursor->ptr && ((((cursor->len)) == 0) || ((cursor->ptr))) VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list=2, s_common_log_subject_list={393:0}, s_list={484:0}, s_list=46, s_tolower_table={455:0}, tl_last_error=0] [L7387] EXPR (cursor->len == 0) || (cursor->len > 0 && cursor->ptr && ((((cursor->len)) == 0) || ((cursor->ptr)))) VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list={393:0}, s_common_log_subject_list=2, s_list=46, s_list={484:0}, s_tolower_table={455:0}, tl_last_error=0] [L7386-L7387] EXPR cursor && ((cursor->len == 0) || (cursor->len > 0 && cursor->ptr && ((((cursor->len)) == 0) || ((cursor->ptr))))) VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list={393:0}, s_common_log_subject_list=2, s_list={484:0}, s_list=46, s_tolower_table={455:0}, tl_last_error=0] [L7386-L7387] return cursor && ((cursor->len == 0) || (cursor->len > 0 && cursor->ptr && ((((cursor->len)) == 0) || ((cursor->ptr))))); [L223] COND TRUE !cond VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list=2, s_common_log_subject_list={393:0}, s_list=46, s_list={484:0}, s_tolower_table={455:0}, tl_last_error=0] [L223] reach_error() VAL [errors={484:0}, s_can_fail_allocator_static={383:0}, s_common_library_initialized=0, s_common_log_subject_infos={393:0}, s_common_log_subject_list={393:0}, s_common_log_subject_list=2, s_list=46, s_list={484:0}, s_tolower_table={455:0}, tl_last_error=0] - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 21326.67ms, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 24.38ms, AutomataDifference: 12370.73ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 6.70ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 252 SdHoareTripleChecker+Valid, 11714.04ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 10761.44ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 346 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 733 IncrementalHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 0 mSDtfsCounter, 733 mSolverCounterSat, 19.92ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 714.02ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=4, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 34.11ms AutomataMinimizationTime, 4 MinimizatonAttempts, 37 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 98.66ms SsaConstructionTime, 4891.69ms SatisfiabilityAnalysisTime, 1017.95ms InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-02 13:06:58,626 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_byte_cursor_from_array_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 13:07:00,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 13:07:00,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 13:07:00,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 13:07:00,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 13:07:00,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 13:07:00,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 13:07:00,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 13:07:00,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 13:07:00,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 13:07:00,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 13:07:00,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 13:07:00,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 13:07:00,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 13:07:00,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 13:07:00,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 13:07:00,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 13:07:00,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 13:07:00,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 13:07:00,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 13:07:00,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 13:07:00,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 13:07:00,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 13:07:00,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 13:07:00,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 13:07:00,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 13:07:00,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 13:07:00,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 13:07:00,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 13:07:00,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 13:07:00,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 13:07:00,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 13:07:00,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 13:07:00,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 13:07:00,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 13:07:00,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 13:07:00,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 13:07:00,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 13:07:00,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 13:07:00,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 13:07:00,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 13:07:00,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-02 13:07:00,393 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 13:07:00,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 13:07:00,393 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 13:07:00,393 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 13:07:00,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 13:07:00,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 13:07:00,394 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 13:07:00,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 13:07:00,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 13:07:00,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 13:07:00,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 13:07:00,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 13:07:00,395 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-02 13:07:00,395 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-02 13:07:00,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 13:07:00,396 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 13:07:00,396 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 13:07:00,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 13:07:00,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 13:07:00,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 13:07:00,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 13:07:00,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 13:07:00,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 13:07:00,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 13:07:00,397 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-02 13:07:00,407 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-02 13:07:00,407 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 13:07:00,408 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 13:07:00,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 13:07:00,408 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 13:07:00,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-02 13:07:00,409 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c [2021-11-02 13:07:00,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 13:07:00,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 13:07:00,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 13:07:00,669 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 13:07:00,669 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 13:07:00,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2021-11-02 13:07:00,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/173cb42b2/ed82c85e95d949c9b10cfcb4278a8cc8/FLAG662507e13 [2021-11-02 13:07:01,312 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 13:07:01,312 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2021-11-02 13:07:01,337 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/173cb42b2/ed82c85e95d949c9b10cfcb4278a8cc8/FLAG662507e13 [2021-11-02 13:07:01,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/173cb42b2/ed82c85e95d949c9b10cfcb4278a8cc8 [2021-11-02 13:07:01,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 13:07:01,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 13:07:01,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 13:07:01,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 13:07:01,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 13:07:01,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 01:07:01" (1/1) ... [2021-11-02 13:07:01,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c8971b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:07:01, skipping insertion in model container [2021-11-02 13:07:01,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 01:07:01" (1/1) ... [2021-11-02 13:07:01,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 13:07:01,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 13:07:01,736 WARN L228 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_byte_cursor_from_array_harness.i[4500,4513] [2021-11-02 13:07:01,742 WARN L228 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_byte_cursor_from_array_harness.i[4560,4573] [2021-11-02 13:07:01,762 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 13:07:01,768 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 13:07:02,258 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,258 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,259 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,259 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,260 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,267 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,269 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,270 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,271 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,498 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 13:07:02,499 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 13:07:02,499 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 13:07:02,500 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 13:07:02,501 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 13:07:02,501 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 13:07:02,502 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 13:07:02,502 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 13:07:02,503 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 13:07:02,503 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 13:07:02,587 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 13:07:02,693 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,693 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 13:07:02,816 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 13:07:02,834 WARN L228 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_byte_cursor_from_array_harness.i[4500,4513] [2021-11-02 13:07:02,835 WARN L228 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_byte_cursor_from_array_harness.i[4560,4573] [2021-11-02 13:07:02,840 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 13:07:02,841 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 13:07:02,876 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,879 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,880 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,880 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,881 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,890 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,890 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,891 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,891 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,915 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 13:07:02,916 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 13:07:02,916 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 13:07:02,917 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 13:07:02,917 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 13:07:02,918 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 13:07:02,920 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 13:07:02,920 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 13:07:02,920 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 13:07:02,921 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 13:07:02,949 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 13:07:02,987 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:02,987 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:07:03,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 13:07:03,225 INFO L208 MainTranslator]: Completed translation [2021-11-02 13:07:03,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:07:03 WrapperNode [2021-11-02 13:07:03,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 13:07:03,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 13:07:03,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 13:07:03,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 13:07:03,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:07:03" (1/1) ... [2021-11-02 13:07:03,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:07:03" (1/1) ... [2021-11-02 13:07:03,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 13:07:03,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 13:07:03,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 13:07:03,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 13:07:03,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:07:03" (1/1) ... [2021-11-02 13:07:03,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:07:03" (1/1) ... [2021-11-02 13:07:03,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:07:03" (1/1) ... [2021-11-02 13:07:03,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:07:03" (1/1) ... [2021-11-02 13:07:03,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:07:03" (1/1) ... [2021-11-02 13:07:03,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:07:03" (1/1) ... [2021-11-02 13:07:03,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:07:03" (1/1) ... [2021-11-02 13:07:03,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 13:07:03,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 13:07:03,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 13:07:03,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 13:07:03,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:07:03" (1/1) ... [2021-11-02 13:07:03,452 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 13:07:03,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:07:03,485 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-11-02 13:07:03,511 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-11-02 13:07:03,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 13:07:03,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-02 13:07:03,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-02 13:07:03,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-02 13:07:03,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 13:07:03,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 13:07:03,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 13:07:03,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 13:07:03,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-02 13:07:03,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-02 13:07:03,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 13:07:03,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 13:07:03,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-02 13:07:03,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 13:07:09,555 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 13:07:09,555 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2021-11-02 13:07:09,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:07:09 BoogieIcfgContainer [2021-11-02 13:07:09,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 13:07:09,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 13:07:09,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 13:07:09,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 13:07:09,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 01:07:01" (1/3) ... [2021-11-02 13:07:09,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581b714c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 01:07:09, skipping insertion in model container [2021-11-02 13:07:09,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:07:03" (2/3) ... [2021-11-02 13:07:09,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581b714c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 01:07:09, skipping insertion in model container [2021-11-02 13:07:09,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:07:09" (3/3) ... [2021-11-02 13:07:09,565 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_array_harness.i [2021-11-02 13:07:09,569 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 13:07:09,569 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-02 13:07:09,610 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 13:07:09,615 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-11-02 13:07:09,618 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-02 13:07:09,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 54 states have (on average 1.462962962962963) internal successors, (79), 59 states have internal predecessors, (79), 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-11-02 13:07:09,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-02 13:07:09,631 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:07:09,632 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:07:09,632 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:07:09,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:07:09,636 INFO L85 PathProgramCache]: Analyzing trace with hash -86834800, now seen corresponding path program 1 times [2021-11-02 13:07:09,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:07:09,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136553564] [2021-11-02 13:07:09,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:07:09,650 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:07:09,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:07:09,652 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:07:09,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-02 13:07:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:07:11,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-02 13:07:11,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:07:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:07:12,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:07:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:07:12,060 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:07:12,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136553564] [2021-11-02 13:07:12,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136553564] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:07:12,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:07:12,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-02 13:07:12,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651560421] [2021-11-02 13:07:12,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 13:07:12,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:07:12,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 13:07:12,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 13:07:12,085 INFO L87 Difference]: Start difference. First operand has 60 states, 54 states have (on average 1.462962962962963) internal successors, (79), 59 states have internal predecessors, (79), 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) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-11-02 13:07:14,369 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:07:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:07:14,726 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2021-11-02 13:07:14,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 13:07:14,728 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) Word has length 12 [2021-11-02 13:07:14,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:07:14,733 INFO L225 Difference]: With dead ends: 117 [2021-11-02 13:07:14,733 INFO L226 Difference]: Without dead ends: 53 [2021-11-02 13:07:14,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.11ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 13:07:14,741 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2497.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.28ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2609.78ms IncrementalHoareTripleChecker+Time [2021-11-02 13:07:14,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 71 Unknown, 0 Unchecked, 1.28ms Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 1 Unknown, 0 Unchecked, 2609.78ms Time] [2021-11-02 13:07:14,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-02 13:07:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-11-02 13:07:14,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 52 states have internal predecessors, (62), 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-11-02 13:07:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2021-11-02 13:07:14,774 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 12 [2021-11-02 13:07:14,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:07:14,779 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2021-11-02 13:07:14,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-11-02 13:07:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2021-11-02 13:07:14,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-02 13:07:14,780 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:07:14,780 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:07:14,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-02 13:07:14,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:07:14,996 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:07:14,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:07:14,996 INFO L85 PathProgramCache]: Analyzing trace with hash -479861810, now seen corresponding path program 1 times [2021-11-02 13:07:15,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:07:15,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756732972] [2021-11-02 13:07:15,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:07:15,002 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:07:15,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:07:15,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:07:15,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-02 13:07:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:07:17,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-02 13:07:17,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:07:17,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:07:17,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:07:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:07:17,163 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:07:17,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756732972] [2021-11-02 13:07:17,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756732972] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:07:17,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:07:17,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-02 13:07:17,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507229099] [2021-11-02 13:07:17,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 13:07:17,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:07:17,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 13:07:17,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 13:07:17,165 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-02 13:07:19,357 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:07:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:07:19,696 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2021-11-02 13:07:19,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 13:07:19,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2021-11-02 13:07:19,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:07:19,697 INFO L225 Difference]: With dead ends: 90 [2021-11-02 13:07:19,697 INFO L226 Difference]: Without dead ends: 53 [2021-11-02 13:07:19,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.83ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 13:07:19,698 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2423.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.58ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2512.61ms IncrementalHoareTripleChecker+Time [2021-11-02 13:07:19,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 97 Unknown, 0 Unchecked, 1.58ms Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 1 Unknown, 0 Unchecked, 2512.61ms Time] [2021-11-02 13:07:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-02 13:07:19,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-11-02 13:07:19,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 52 states have internal predecessors, (61), 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-11-02 13:07:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2021-11-02 13:07:19,702 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 12 [2021-11-02 13:07:19,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:07:19,702 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2021-11-02 13:07:19,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-02 13:07:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2021-11-02 13:07:19,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-02 13:07:19,703 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:07:19,703 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:07:19,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-02 13:07:19,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:07:19,922 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:07:19,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:07:19,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1018024457, now seen corresponding path program 1 times [2021-11-02 13:07:19,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:07:19,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027876026] [2021-11-02 13:07:19,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:07:19,926 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:07:19,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:07:19,927 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:07:19,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-02 13:07:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:07:22,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 1557 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 13:07:22,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:07:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:07:22,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:07:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:07:22,325 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:07:22,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027876026] [2021-11-02 13:07:22,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027876026] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:07:22,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:07:22,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2021-11-02 13:07:22,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430568754] [2021-11-02 13:07:22,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:07:22,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:07:22,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:07:22,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:07:22,327 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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-11-02 13:07:24,519 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:07:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:07:25,892 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2021-11-02 13:07:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 13:07:25,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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) Word has length 14 [2021-11-02 13:07:25,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:07:25,893 INFO L225 Difference]: With dead ends: 97 [2021-11-02 13:07:25,893 INFO L226 Difference]: Without dead ends: 93 [2021-11-02 13:07:25,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 302.24ms TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-11-02 13:07:25,894 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3201.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.13ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3335.00ms IncrementalHoareTripleChecker+Time [2021-11-02 13:07:25,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 415 Unknown, 0 Unchecked, 9.13ms Time], IncrementalHoareTripleChecker [27 Valid, 387 Invalid, 1 Unknown, 0 Unchecked, 3335.00ms Time] [2021-11-02 13:07:25,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-02 13:07:25,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 61. [2021-11-02 13:07:25,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 60 states have internal predecessors, (69), 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-11-02 13:07:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2021-11-02 13:07:25,904 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 14 [2021-11-02 13:07:25,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:07:25,905 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2021-11-02 13:07:25,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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-11-02 13:07:25,905 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2021-11-02 13:07:25,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-02 13:07:25,906 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:07:25,906 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:07:25,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-02 13:07:26,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:07:26,116 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:07:26,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:07:26,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1084310207, now seen corresponding path program 1 times [2021-11-02 13:07:26,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:07:26,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688536341] [2021-11-02 13:07:26,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:07:26,120 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:07:26,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:07:26,121 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:07:26,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-02 13:07:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:07:35,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 1566 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-02 13:07:35,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:07:35,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2021-11-02 13:07:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:07:35,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:07:35,815 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 13:07:35,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 17 [2021-11-02 13:07:35,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-11-02 13:07:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:07:35,848 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:07:35,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688536341] [2021-11-02 13:07:35,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688536341] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:07:35,848 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:07:35,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2021-11-02 13:07:35,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304676351] [2021-11-02 13:07:35,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:07:35,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:07:35,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:07:35,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:07:35,849 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-11-02 13:07:38,071 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:07:39,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:07:39,489 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2021-11-02 13:07:39,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 13:07:39,490 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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) Word has length 18 [2021-11-02 13:07:39,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:07:39,490 INFO L225 Difference]: With dead ends: 111 [2021-11-02 13:07:39,490 INFO L226 Difference]: Without dead ends: 68 [2021-11-02 13:07:39,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 435.11ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-02 13:07:39,492 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3156.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.76ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3305.08ms IncrementalHoareTripleChecker+Time [2021-11-02 13:07:39,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 270 Unknown, 0 Unchecked, 6.76ms Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 1 Unknown, 0 Unchecked, 3305.08ms Time] [2021-11-02 13:07:39,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-02 13:07:39,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2021-11-02 13:07:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 62 states have internal predecessors, (71), 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-11-02 13:07:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2021-11-02 13:07:39,497 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 18 [2021-11-02 13:07:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:07:39,497 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2021-11-02 13:07:39,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-11-02 13:07:39,497 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2021-11-02 13:07:39,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-02 13:07:39,498 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:07:39,498 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:07:39,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-02 13:07:39,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:07:39,699 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:07:39,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:07:39,700 INFO L85 PathProgramCache]: Analyzing trace with hash -404251837, now seen corresponding path program 1 times [2021-11-02 13:07:39,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:07:39,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554696391] [2021-11-02 13:07:39,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:07:39,703 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:07:39,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:07:39,704 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:07:39,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-02 13:07:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:07:41,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-02 13:07:41,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:07:42,016 INFO L388 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 20 treesize of output 20 [2021-11-02 13:07:43,960 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 13:07:43,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 35 [2021-11-02 13:07:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:07:44,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:07:44,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2021-11-02 13:07:44,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:07:44,611 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:07:44,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554696391] [2021-11-02 13:07:44,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554696391] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:07:44,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:07:44,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2021-11-02 13:07:44,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270235057] [2021-11-02 13:07:44,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 13:07:44,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:07:44,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 13:07:44,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-02 13:07:44,613 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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-11-02 13:07:46,818 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:07:48,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:07:48,593 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2021-11-02 13:07:48,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 13:07:48,594 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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) Word has length 18 [2021-11-02 13:07:48,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:07:48,594 INFO L225 Difference]: With dead ends: 108 [2021-11-02 13:07:48,594 INFO L226 Difference]: Without dead ends: 61 [2021-11-02 13:07:48,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2512.39ms TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-11-02 13:07:48,595 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3559.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.36ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 3725.49ms IncrementalHoareTripleChecker+Time [2021-11-02 13:07:48,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 489 Unknown, 0 Unchecked, 5.36ms Time], IncrementalHoareTripleChecker [2 Valid, 483 Invalid, 1 Unknown, 3 Unchecked, 3725.49ms Time] [2021-11-02 13:07:48,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-02 13:07:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-11-02 13:07:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 60 states have internal predecessors, (67), 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-11-02 13:07:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2021-11-02 13:07:48,604 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 18 [2021-11-02 13:07:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:07:48,604 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2021-11-02 13:07:48,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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-11-02 13:07:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2021-11-02 13:07:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-02 13:07:48,605 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:07:48,605 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:07:48,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-02 13:07:48,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:07:48,810 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:07:48,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:07:48,810 INFO L85 PathProgramCache]: Analyzing trace with hash 501656654, now seen corresponding path program 1 times [2021-11-02 13:07:48,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:07:48,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068506089] [2021-11-02 13:07:48,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:07:48,813 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:07:48,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:07:48,814 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:07:48,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-02 13:07:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:07:51,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 1576 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-02 13:07:51,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:07:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:07:51,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:07:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:07:51,312 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:07:51,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068506089] [2021-11-02 13:07:51,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068506089] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:07:51,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:07:51,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-02 13:07:51,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071067967] [2021-11-02 13:07:51,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 13:07:51,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:07:51,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 13:07:51,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 13:07:51,313 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-11-02 13:07:53,517 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:07:53,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:07:53,954 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2021-11-02 13:07:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 13:07:53,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 20 [2021-11-02 13:07:53,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:07:53,955 INFO L225 Difference]: With dead ends: 82 [2021-11-02 13:07:53,955 INFO L226 Difference]: Without dead ends: 61 [2021-11-02 13:07:53,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.18ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:07:53,956 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2504.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.66ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2603.01ms IncrementalHoareTripleChecker+Time [2021-11-02 13:07:53,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 95 Unknown, 0 Unchecked, 1.66ms Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 1 Unknown, 0 Unchecked, 2603.01ms Time] [2021-11-02 13:07:53,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-02 13:07:53,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-11-02 13:07:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 60 states have internal predecessors, (66), 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-11-02 13:07:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2021-11-02 13:07:53,960 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 20 [2021-11-02 13:07:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:07:53,961 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2021-11-02 13:07:53,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-11-02 13:07:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2021-11-02 13:07:53,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-02 13:07:53,962 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:07:53,962 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:07:54,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-02 13:07:54,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:07:54,168 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:07:54,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:07:54,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1522937572, now seen corresponding path program 1 times [2021-11-02 13:07:54,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:07:54,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131575059] [2021-11-02 13:07:54,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:07:54,172 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:07:54,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:07:54,173 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:07:54,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-02 13:07:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:07:56,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 1570 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-02 13:07:56,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:07:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:07:56,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:07:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:07:56,806 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:07:56,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131575059] [2021-11-02 13:07:56,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131575059] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:07:56,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:07:56,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2021-11-02 13:07:56,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906518950] [2021-11-02 13:07:56,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 13:07:56,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:07:56,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 13:07:56,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-02 13:07:56,807 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-11-02 13:07:59,013 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:08:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:08:00,166 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2021-11-02 13:08:00,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 13:08:00,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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) Word has length 20 [2021-11-02 13:08:00,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:08:00,167 INFO L225 Difference]: With dead ends: 123 [2021-11-02 13:08:00,167 INFO L226 Difference]: Without dead ends: 79 [2021-11-02 13:08:00,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 367.71ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:08:00,168 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3014.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.35ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3151.89ms IncrementalHoareTripleChecker+Time [2021-11-02 13:08:00,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 264 Unknown, 0 Unchecked, 3.35ms Time], IncrementalHoareTripleChecker [9 Valid, 254 Invalid, 1 Unknown, 0 Unchecked, 3151.89ms Time] [2021-11-02 13:08:00,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-11-02 13:08:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2021-11-02 13:08:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 60 states have internal predecessors, (64), 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-11-02 13:08:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2021-11-02 13:08:00,175 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 20 [2021-11-02 13:08:00,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:08:00,176 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2021-11-02 13:08:00,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-11-02 13:08:00,176 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2021-11-02 13:08:00,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-02 13:08:00,177 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:08:00,177 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:08:00,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-02 13:08:00,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:08:00,391 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:08:00,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:08:00,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1962683098, now seen corresponding path program 1 times [2021-11-02 13:08:00,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:08:00,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004817764] [2021-11-02 13:08:00,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:08:00,395 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:08:00,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:08:00,396 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:08:00,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-02 13:08:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:08:02,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 1573 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-02 13:08:02,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:08:02,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-11-02 13:08:02,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2021-11-02 13:08:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:08:03,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:08:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:08:03,729 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:08:03,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004817764] [2021-11-02 13:08:03,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004817764] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:08:03,729 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:08:03,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 15 [2021-11-02 13:08:03,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647824846] [2021-11-02 13:08:03,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-02 13:08:03,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:08:03,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-02 13:08:03,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-11-02 13:08:03,730 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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-11-02 13:08:05,939 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:08:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:08:12,494 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2021-11-02 13:08:12,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-02 13:08:12,495 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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) Word has length 20 [2021-11-02 13:08:12,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:08:12,495 INFO L225 Difference]: With dead ends: 112 [2021-11-02 13:08:12,495 INFO L226 Difference]: Without dead ends: 108 [2021-11-02 13:08:12,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 4535.77ms TimeCoverageRelationStatistics Valid=335, Invalid=1225, Unknown=0, NotChecked=0, Total=1560 [2021-11-02 13:08:12,497 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 169 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 74 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4757.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.11ms SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5038.58ms IncrementalHoareTripleChecker+Time [2021-11-02 13:08:12,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 0 Invalid, 808 Unknown, 0 Unchecked, 11.11ms Time], IncrementalHoareTripleChecker [74 Valid, 733 Invalid, 1 Unknown, 0 Unchecked, 5038.58ms Time] [2021-11-02 13:08:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-02 13:08:12,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 56. [2021-11-02 13:08:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 55 states have internal predecessors, (59), 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-11-02 13:08:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-11-02 13:08:12,501 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 20 [2021-11-02 13:08:12,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:08:12,502 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-11-02 13:08:12,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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-11-02 13:08:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-11-02 13:08:12,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-02 13:08:12,502 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:08:12,503 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:08:12,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-11-02 13:08:12,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:08:12,707 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:08:12,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:08:12,708 INFO L85 PathProgramCache]: Analyzing trace with hash -863865621, now seen corresponding path program 1 times [2021-11-02 13:08:12,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:08:12,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608863695] [2021-11-02 13:08:12,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:08:12,711 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:08:12,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:08:12,712 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:08:12,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-02 13:08:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:08:25,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 1584 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-02 13:08:25,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:08:25,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:08:25,722 INFO L388 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 18 treesize of output 19 [2021-11-02 13:08:26,936 INFO L354 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2021-11-02 13:08:26,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 46 [2021-11-02 13:08:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:08:27,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:08:28,337 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 13:08:28,338 INFO L388 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 1450 treesize of output 1394 [2021-11-02 13:08:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:08:32,936 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:08:32,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608863695] [2021-11-02 13:08:32,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608863695] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:08:32,936 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:08:32,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 9] imperfect sequences [] total 18 [2021-11-02 13:08:32,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749255545] [2021-11-02 13:08:32,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-02 13:08:32,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:08:32,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-02 13:08:32,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-11-02 13:08:32,938 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 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-11-02 13:08:35,159 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:08:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:08:37,617 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2021-11-02 13:08:37,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-02 13:08:37,617 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 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) Word has length 24 [2021-11-02 13:08:37,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:08:37,618 INFO L225 Difference]: With dead ends: 74 [2021-11-02 13:08:37,618 INFO L226 Difference]: Without dead ends: 72 [2021-11-02 13:08:37,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 3006.51ms TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2021-11-02 13:08:37,619 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3103.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.44ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 3243.64ms IncrementalHoareTripleChecker+Time [2021-11-02 13:08:37,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 334 Unknown, 0 Unchecked, 4.44ms Time], IncrementalHoareTripleChecker [6 Valid, 209 Invalid, 1 Unknown, 118 Unchecked, 3243.64ms Time] [2021-11-02 13:08:37,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-02 13:08:37,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2021-11-02 13:08:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.121212121212121) internal successors, (74), 69 states have internal predecessors, (74), 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-11-02 13:08:37,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2021-11-02 13:08:37,625 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 24 [2021-11-02 13:08:37,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:08:37,625 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2021-11-02 13:08:37,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 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-11-02 13:08:37,625 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2021-11-02 13:08:37,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-02 13:08:37,626 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:08:37,626 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:08:37,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-11-02 13:08:37,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:08:37,831 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:08:37,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:08:37,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1075136575, now seen corresponding path program 1 times [2021-11-02 13:08:37,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:08:37,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579393089] [2021-11-02 13:08:37,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:08:37,836 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:08:37,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:08:37,837 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:08:37,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-02 13:08:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:08:40,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 1589 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-02 13:08:40,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:08:40,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:08:40,302 INFO L388 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 22 treesize of output 22 [2021-11-02 13:08:41,403 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-02 13:08:41,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 35 [2021-11-02 13:08:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:08:41,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:08:43,181 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-02 13:08:43,181 INFO L388 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 1416 treesize of output 1 [2021-11-02 13:08:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:08:43,191 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:08:43,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579393089] [2021-11-02 13:08:43,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579393089] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:08:43,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:08:43,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 8] imperfect sequences [] total 16 [2021-11-02 13:08:43,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867253210] [2021-11-02 13:08:43,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-02 13:08:43,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:08:43,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-02 13:08:43,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-11-02 13:08:43,193 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 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-11-02 13:08:45,444 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:08:46,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:08:46,743 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2021-11-02 13:08:46,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 13:08:46,743 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 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) Word has length 26 [2021-11-02 13:08:46,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:08:46,744 INFO L225 Difference]: With dead ends: 105 [2021-11-02 13:08:46,744 INFO L226 Difference]: Without dead ends: 72 [2021-11-02 13:08:46,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2485.32ms TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2021-11-02 13:08:46,745 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3001.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.50ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 3128.54ms IncrementalHoareTripleChecker+Time [2021-11-02 13:08:46,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 444 Unknown, 0 Unchecked, 3.50ms Time], IncrementalHoareTripleChecker [2 Valid, 228 Invalid, 1 Unknown, 213 Unchecked, 3128.54ms Time] [2021-11-02 13:08:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-02 13:08:46,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2021-11-02 13:08:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.106060606060606) internal successors, (73), 69 states have internal predecessors, (73), 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-11-02 13:08:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2021-11-02 13:08:46,749 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 26 [2021-11-02 13:08:46,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:08:46,750 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2021-11-02 13:08:46,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 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-11-02 13:08:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2021-11-02 13:08:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-02 13:08:46,750 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:08:46,750 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:08:46,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-11-02 13:08:46,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:08:46,976 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:08:46,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:08:46,976 INFO L85 PathProgramCache]: Analyzing trace with hash 27288689, now seen corresponding path program 1 times [2021-11-02 13:08:46,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:08:46,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697929871] [2021-11-02 13:08:46,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:08:46,980 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:08:46,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:08:46,981 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:08:46,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-02 13:08:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:08:49,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 1603 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-02 13:08:49,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:08:49,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2021-11-02 13:08:49,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-11-02 13:08:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:08:49,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:08:50,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:08:50,265 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:08:50,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697929871] [2021-11-02 13:08:50,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697929871] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:08:50,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:08:50,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2021-11-02 13:08:50,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204547667] [2021-11-02 13:08:50,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:08:50,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:08:50,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:08:50,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:08:50,267 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-11-02 13:08:52,507 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:08:54,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:08:54,280 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2021-11-02 13:08:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 13:08:54,281 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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) Word has length 27 [2021-11-02 13:08:54,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:08:54,282 INFO L225 Difference]: With dead ends: 70 [2021-11-02 13:08:54,282 INFO L226 Difference]: Without dead ends: 68 [2021-11-02 13:08:54,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 928.50ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-11-02 13:08:54,283 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3193.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.45ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3373.41ms IncrementalHoareTripleChecker+Time [2021-11-02 13:08:54,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 228 Unknown, 0 Unchecked, 4.45ms Time], IncrementalHoareTripleChecker [6 Valid, 221 Invalid, 1 Unknown, 0 Unchecked, 3373.41ms Time] [2021-11-02 13:08:54,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-02 13:08:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-11-02 13:08:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 67 states have internal predecessors, (71), 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-11-02 13:08:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-11-02 13:08:54,292 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 27 [2021-11-02 13:08:54,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:08:54,293 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-11-02 13:08:54,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-11-02 13:08:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-11-02 13:08:54,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-02 13:08:54,293 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:08:54,293 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:08:54,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-02 13:08:54,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:08:54,504 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:08:54,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:08:54,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1485259652, now seen corresponding path program 1 times [2021-11-02 13:08:54,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:08:54,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270125586] [2021-11-02 13:08:54,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:08:54,508 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:08:54,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:08:54,509 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:08:54,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-02 13:08:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:08:56,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 1600 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-02 13:08:56,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:08:57,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:08:57,198 INFO L388 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 22 treesize of output 22 [2021-11-02 13:08:59,267 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-02 13:08:59,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 47 [2021-11-02 13:08:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:08:59,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:09:00,978 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-02 13:09:00,980 INFO L388 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 1448 treesize of output 1 [2021-11-02 13:09:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:09:00,989 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:09:00,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270125586] [2021-11-02 13:09:00,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270125586] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:09:00,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:09:00,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 8] imperfect sequences [] total 16 [2021-11-02 13:09:00,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549362792] [2021-11-02 13:09:00,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-02 13:09:00,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:09:00,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-02 13:09:00,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-11-02 13:09:00,991 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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-11-02 13:09:03,232 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:09:04,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:09:04,982 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2021-11-02 13:09:04,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 13:09:04,983 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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) Word has length 30 [2021-11-02 13:09:04,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:09:04,983 INFO L225 Difference]: With dead ends: 86 [2021-11-02 13:09:04,983 INFO L226 Difference]: Without dead ends: 68 [2021-11-02 13:09:04,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2851.79ms TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-11-02 13:09:04,984 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3098.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.08ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 3237.46ms IncrementalHoareTripleChecker+Time [2021-11-02 13:09:04,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 412 Unknown, 0 Unchecked, 3.08ms Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 1 Unknown, 175 Unchecked, 3237.46ms Time] [2021-11-02 13:09:04,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-02 13:09:04,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-11-02 13:09:04,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 67 states have internal predecessors, (70), 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-11-02 13:09:04,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2021-11-02 13:09:04,988 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 30 [2021-11-02 13:09:04,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:09:04,988 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2021-11-02 13:09:04,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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-11-02 13:09:04,989 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2021-11-02 13:09:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-02 13:09:04,989 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:09:04,990 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:09:05,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-11-02 13:09:05,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:09:05,195 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:09:05,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:09:05,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1328145208, now seen corresponding path program 1 times [2021-11-02 13:09:05,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:09:05,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796583568] [2021-11-02 13:09:05,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:09:05,199 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:09:05,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:09:05,200 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:09:05,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-02 13:09:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:09:07,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 1615 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-02 13:09:07,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:09:07,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:09:07,666 INFO L388 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 22 treesize of output 22 [2021-11-02 13:09:09,158 INFO L354 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2021-11-02 13:09:09,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 23 [2021-11-02 13:09:09,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:09:09,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:09:11,090 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-02 13:09:11,090 INFO L388 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 2650 treesize of output 1 [2021-11-02 13:09:11,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:09:11,101 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:09:11,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796583568] [2021-11-02 13:09:11,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796583568] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:09:11,101 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:09:11,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 8] imperfect sequences [] total 17 [2021-11-02 13:09:11,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427938187] [2021-11-02 13:09:11,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-02 13:09:11,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:09:11,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 13:09:11,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-11-02 13:09:11,102 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 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-11-02 13:09:13,333 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:09:14,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:09:14,788 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2021-11-02 13:09:14,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 13:09:14,788 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 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) Word has length 32 [2021-11-02 13:09:14,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:09:14,788 INFO L225 Difference]: With dead ends: 78 [2021-11-02 13:09:14,788 INFO L226 Difference]: Without dead ends: 54 [2021-11-02 13:09:14,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2807.43ms TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2021-11-02 13:09:14,789 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3056.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.46ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 3208.65ms IncrementalHoareTripleChecker+Time [2021-11-02 13:09:14,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 460 Unknown, 0 Unchecked, 3.46ms Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 1 Unknown, 253 Unchecked, 3208.65ms Time] [2021-11-02 13:09:14,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-11-02 13:09:14,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-11-02 13:09:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 53 states have internal predecessors, (55), 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-11-02 13:09:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2021-11-02 13:09:14,792 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 32 [2021-11-02 13:09:14,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:09:14,792 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2021-11-02 13:09:14,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 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-11-02 13:09:14,792 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2021-11-02 13:09:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-02 13:09:14,793 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:09:14,793 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:09:14,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-02 13:09:15,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:09:15,007 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:09:15,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:09:15,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1234346222, now seen corresponding path program 1 times [2021-11-02 13:09:15,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:09:15,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063429883] [2021-11-02 13:09:15,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:09:15,013 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:09:15,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:09:15,015 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:09:15,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-02 13:09:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:09:17,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 1605 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-02 13:09:17,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:09:19,096 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-02 13:09:19,097 INFO L388 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 77 treesize of output 57 [2021-11-02 13:09:19,108 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-02 13:09:19,108 INFO L388 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 54 treesize of output 34 [2021-11-02 13:09:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:09:19,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:09:30,995 WARN L210 SmtUtils]: Spent 10.41s on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2021-11-02 13:09:30,995 INFO L354 Elim1Store]: treesize reduction 27, result has 41.3 percent of original size [2021-11-02 13:09:30,995 INFO L388 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 72 treesize of output 66 [2021-11-02 13:09:31,055 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-02 13:09:31,055 INFO L388 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 58 treesize of output 41 [2021-11-02 13:09:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:09:31,213 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:09:31,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063429883] [2021-11-02 13:09:31,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063429883] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:09:31,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:09:31,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 17 [2021-11-02 13:09:31,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043421451] [2021-11-02 13:09:31,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-02 13:09:31,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:09:31,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 13:09:31,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-11-02 13:09:31,214 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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-11-02 13:09:33,406 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:09:35,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:09:35,729 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2021-11-02 13:09:35,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-02 13:09:35,730 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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) Word has length 32 [2021-11-02 13:09:35,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:09:35,730 INFO L225 Difference]: With dead ends: 82 [2021-11-02 13:09:35,730 INFO L226 Difference]: Without dead ends: 61 [2021-11-02 13:09:35,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2843.11ms TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2021-11-02 13:09:35,732 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3047.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.47ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 3180.52ms IncrementalHoareTripleChecker+Time [2021-11-02 13:09:35,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 359 Unknown, 0 Unchecked, 3.47ms Time], IncrementalHoareTripleChecker [6 Valid, 257 Invalid, 1 Unknown, 95 Unchecked, 3180.52ms Time] [2021-11-02 13:09:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-02 13:09:35,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2021-11-02 13:09:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 55 states have internal predecessors, (57), 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-11-02 13:09:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2021-11-02 13:09:35,734 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 32 [2021-11-02 13:09:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:09:35,734 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2021-11-02 13:09:35,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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-11-02 13:09:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2021-11-02 13:09:35,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-02 13:09:35,735 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:09:35,735 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:09:35,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-02 13:09:35,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:09:35,938 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:09:35,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:09:35,938 INFO L85 PathProgramCache]: Analyzing trace with hash -554287852, now seen corresponding path program 1 times [2021-11-02 13:09:35,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:09:35,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872529290] [2021-11-02 13:09:35,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:09:35,941 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:09:35,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:09:35,942 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:09:35,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-02 13:09:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:09:38,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 1602 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-02 13:09:38,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:09:38,361 INFO L354 Elim1Store]: treesize reduction 22, result has 26.7 percent of original size [2021-11-02 13:09:38,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-11-02 13:09:40,138 INFO L354 Elim1Store]: treesize reduction 24, result has 61.9 percent of original size [2021-11-02 13:09:40,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 79 [2021-11-02 13:09:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:09:40,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:09:41,426 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 13:09:41,427 INFO L388 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 1174 treesize of output 1140 [2021-11-02 13:09:41,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 13:09:41,819 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-02 13:09:41,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1080 treesize of output 1024 [2021-11-02 13:10:07,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:10:07,670 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:10:07,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872529290] [2021-11-02 13:10:07,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872529290] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:10:07,670 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:10:07,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 17 [2021-11-02 13:10:07,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392047825] [2021-11-02 13:10:07,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-02 13:10:07,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:10:07,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 13:10:07,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-11-02 13:10:07,671 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 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-11-02 13:10:09,900 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:10:11,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:10:11,156 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2021-11-02 13:10:11,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 13:10:11,156 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 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) Word has length 32 [2021-11-02 13:10:11,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:10:11,157 INFO L225 Difference]: With dead ends: 77 [2021-11-02 13:10:11,157 INFO L226 Difference]: Without dead ends: 47 [2021-11-02 13:10:11,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2235.10ms TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-11-02 13:10:11,158 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2920.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.67ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 3049.55ms IncrementalHoareTripleChecker+Time [2021-11-02 13:10:11,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 0 Invalid, 317 Unknown, 0 Unchecked, 1.67ms Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 1 Unknown, 102 Unchecked, 3049.55ms Time] [2021-11-02 13:10:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-11-02 13:10:11,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-11-02 13:10:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 46 states have internal predecessors, (46), 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-11-02 13:10:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 46 transitions. [2021-11-02 13:10:11,160 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 46 transitions. Word has length 32 [2021-11-02 13:10:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:10:11,160 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 46 transitions. [2021-11-02 13:10:11,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 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-11-02 13:10:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 46 transitions. [2021-11-02 13:10:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 13:10:11,161 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:10:11,161 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:10:11,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-02 13:10:11,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:10:11,365 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:10:11,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:10:11,366 INFO L85 PathProgramCache]: Analyzing trace with hash -821254579, now seen corresponding path program 1 times [2021-11-02 13:10:11,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:10:11,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584437134] [2021-11-02 13:10:11,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:10:11,369 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:10:11,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:10:11,370 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:10:11,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-02 13:10:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:10:45,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-02 13:10:45,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:10:45,693 INFO L354 Elim1Store]: treesize reduction 22, result has 26.7 percent of original size [2021-11-02 13:10:45,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-11-02 13:10:47,148 INFO L354 Elim1Store]: treesize reduction 48, result has 37.7 percent of original size [2021-11-02 13:10:47,149 INFO L388 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 104 treesize of output 72 [2021-11-02 13:10:47,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:10:47,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:10:48,254 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 13:10:48,255 INFO L388 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 1531 treesize of output 1477 [2021-11-02 13:10:48,387 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 13:10:49,495 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-02 13:10:49,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1201 treesize of output 1135 [2021-11-02 13:11:00,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:11:00,107 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:11:00,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584437134] [2021-11-02 13:11:00,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584437134] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:11:00,107 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:11:00,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [] total 14 [2021-11-02 13:11:00,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742490326] [2021-11-02 13:11:00,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-02 13:11:00,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:11:00,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-02 13:11:00,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-02 13:11:00,108 INFO L87 Difference]: Start difference. First operand 47 states and 46 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 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-11-02 13:11:02,312 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:11:03,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:11:03,316 INFO L93 Difference]: Finished difference Result 47 states and 46 transitions. [2021-11-02 13:11:03,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 13:11:03,317 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 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) Word has length 36 [2021-11-02 13:11:03,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:11:03,317 INFO L225 Difference]: With dead ends: 47 [2021-11-02 13:11:03,317 INFO L226 Difference]: Without dead ends: 45 [2021-11-02 13:11:03,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1254.49ms TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-11-02 13:11:03,318 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2678.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.46ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 2788.05ms IncrementalHoareTripleChecker+Time [2021-11-02 13:11:03,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 216 Unknown, 0 Unchecked, 1.46ms Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 1 Unknown, 87 Unchecked, 2788.05ms Time] [2021-11-02 13:11:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-11-02 13:11:03,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-11-02 13:11:03,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0) internal successors, (44), 44 states have internal predecessors, (44), 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-11-02 13:11:03,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 44 transitions. [2021-11-02 13:11:03,320 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 44 transitions. Word has length 36 [2021-11-02 13:11:03,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:11:03,321 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 44 transitions. [2021-11-02 13:11:03,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 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-11-02 13:11:03,321 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 44 transitions. [2021-11-02 13:11:03,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-02 13:11:03,321 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:11:03,321 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:11:03,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-02 13:11:03,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:11:03,548 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:11:03,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:11:03,548 INFO L85 PathProgramCache]: Analyzing trace with hash 52794010, now seen corresponding path program 1 times [2021-11-02 13:11:03,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 13:11:03,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812902027] [2021-11-02 13:11:03,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:11:03,551 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 13:11:03,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 13:11:03,552 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 13:11:03,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-02 13:11:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:11:54,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 1647 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-02 13:11:54,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:11:54,951 INFO L354 Elim1Store]: treesize reduction 85, result has 9.6 percent of original size [2021-11-02 13:11:54,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 9 [2021-11-02 13:11:54,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:11:54,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:11:54,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 13:11:55,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 9 [2021-11-02 13:11:56,504 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-02 13:11:56,504 INFO L388 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 67 treesize of output 43 [2021-11-02 13:11:56,516 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-02 13:11:56,516 INFO L388 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 37 treesize of output 13 [2021-11-02 13:11:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:11:56,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:11:56,980 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-11-02 13:11:56,980 INFO L388 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 19 treesize of output 15 [2021-11-02 13:11:58,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 82 [2021-11-02 13:11:58,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2021-11-02 13:11:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:11:58,406 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 13:11:58,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812902027] [2021-11-02 13:11:58,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812902027] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 13:11:58,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:11:58,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2021-11-02 13:11:58,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277673729] [2021-11-02 13:11:58,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 13:11:58,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 13:11:58,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 13:11:58,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-02 13:11:58,408 INFO L87 Difference]: Start difference. First operand 45 states and 44 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 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-11-02 13:12:00,668 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:12:02,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:12:02,217 INFO L93 Difference]: Finished difference Result 45 states and 44 transitions. [2021-11-02 13:12:02,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 13:12:02,219 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 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) Word has length 44 [2021-11-02 13:12:02,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:12:02,219 INFO L225 Difference]: With dead ends: 45 [2021-11-02 13:12:02,219 INFO L226 Difference]: Without dead ends: 0 [2021-11-02 13:12:02,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1438.70ms TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-11-02 13:12:02,220 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3088.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.23ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 3237.69ms IncrementalHoareTripleChecker+Time [2021-11-02 13:12:02,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 300 Unknown, 0 Unchecked, 2.23ms Time], IncrementalHoareTripleChecker [7 Valid, 188 Invalid, 1 Unknown, 104 Unchecked, 3237.69ms Time] [2021-11-02 13:12:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-02 13:12:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-02 13:12:02,221 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-11-02 13:12:02,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-02 13:12:02,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2021-11-02 13:12:02,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:12:02,221 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-02 13:12:02,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 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-11-02 13:12:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-02 13:12:02,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-02 13:12:02,224 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-11-02 13:12:02,224 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-11-02 13:12:02,224 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-11-02 13:12:02,224 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-11-02 13:12:02,225 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-11-02 13:12:02,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-11-02 13:12:02,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 13:12:02,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-02 13:12:02,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:12:02,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:12:02,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:12:02,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:12:02,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:12:02,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 13:12:05,990 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:12:05,991 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:12:05,991 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-02 13:12:05,991 INFO L858 garLoopResultBuilder]: For program point L7386(lines 7386 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,991 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-02 13:12:05,991 INFO L858 garLoopResultBuilder]: For program point L7386-4(lines 7386 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,991 INFO L854 garLoopResultBuilder]: At program point L7386-3(lines 7384 7388) the Hoare annotation is: (let ((.cse14 (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base|))) (let ((.cse10 (select .cse14 |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset|)) (.cse9 (select .cse14 (bvadd |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset| (_ bv4 64))))) (let ((.cse0 (= (_ bv0 64) ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse1 (= ((_ extract 63 32) ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) .cse9)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| (_ bv1 8))) (.cse3 (not (= (_ bv0 64) |ULTIMATE.start_bounded_malloc_#res.base|))) (.cse4 (= (_ bv0 64) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset|)) (.cse5 (not (= (_ bv0 64) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|))) (.cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset| (_ bv0 64))) (.cse7 (= ULTIMATE.start_aws_byte_cursor_from_array_~len ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2)) (.cse8 (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base|)) (.cse11 (not (= (_ bv0 64) ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base))) (.cse12 (= ((_ extract 31 0) ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) .cse10))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base (_ bv0 64))) .cse2 .cse3 .cse4 (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (_ bv8 64)))) .cse5 .cse6 .cse7 .cse8 (= (concat .cse9 .cse10) (_ bv0 64)) .cse11 .cse12) (let ((.cse13 (bvadd |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset| (_ bv8 64)))) (and (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base|) .cse13)) .cse4 (bvule ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 (_ bv36028797018963967 64)) (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.offset (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base|) .cse13)) .cse5 .cse6 .cse7 (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.offset ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.offset) .cse8 .cse11 .cse12)))))) [2021-11-02 13:12:05,991 INFO L858 garLoopResultBuilder]: For program point L7386-2(lines 7386 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,991 INFO L854 garLoopResultBuilder]: At program point L7386-7(lines 7384 7388) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base (_ bv0 64)))) (.cse1 (= (_ bv1 8) ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| (_ bv1 8))) (.cse8 (not (= (_ bv0 64) |ULTIMATE.start_bounded_malloc_#res.base|))) (.cse10 (not (= (_ bv0 64) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|))) (.cse11 (not (= (_ bv0 64) ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base)))) (or (let ((.cse9 (bvadd (_ bv8 64) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset|))) (and .cse0 .cse1 .cse2 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38| (_ BitVec 64)) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38| (_ BitVec 64))) (let ((.cse7 (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38|))) (let ((.cse6 (select .cse7 (bvadd |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38| (_ bv4 64)))) (.cse3 (select .cse7 |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38|))) (let ((.cse5 (concat .cse6 .cse3)) (.cse4 (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|))) (and (= ((_ extract 31 0) ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) .cse3) (= (select .cse4 (bvadd |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset| (_ bv4 64))) ((_ extract 63 32) .cse5)) (= ((_ extract 31 0) .cse5) (select .cse4 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset|)) (= ((_ extract 63 32) ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) .cse6)))))) .cse8 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) .cse9)) (bvule ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 (_ bv36028797018963967 64)) .cse10 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.offset (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) .cse9)) .cse11)) (and .cse0 .cse1 .cse2 .cse8 .cse10 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15| (_ BitVec 64))) (let ((.cse16 (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15|))) (let ((.cse12 (select .cse16 (_ bv4 64))) (.cse15 (select .cse16 (_ bv0 64)))) (let ((.cse13 (concat .cse12 .cse15)) (.cse14 (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|))) (and (= ((_ extract 63 32) ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) .cse12) (= ((_ extract 63 32) .cse13) (select .cse14 (bvadd |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset| (_ bv4 64)))) (= ((_ extract 31 0) ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) .cse15) (= (_ bv0 64) .cse13) (= ((_ extract 31 0) .cse13) (select .cse14 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset|))))))) .cse11))) [2021-11-02 13:12:05,991 INFO L858 garLoopResultBuilder]: For program point L7386-6(lines 7386 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,991 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:12:05,992 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:12:05,992 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-02 13:12:05,992 INFO L858 garLoopResultBuilder]: For program point L7387(line 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,992 INFO L858 garLoopResultBuilder]: For program point L7387-5(line 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,992 INFO L858 garLoopResultBuilder]: For program point L7387-4(line 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,992 INFO L858 garLoopResultBuilder]: For program point L7387-2(line 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,992 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:12:05,992 INFO L858 garLoopResultBuilder]: For program point L7387-8(line 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,992 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-02 13:12:05,992 INFO L858 garLoopResultBuilder]: For program point L7387-6(line 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,992 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-02 13:12:05,992 INFO L858 garLoopResultBuilder]: For program point L7387-12(line 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,992 INFO L858 garLoopResultBuilder]: For program point L7387-11(line 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,992 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-02 13:12:05,993 INFO L858 garLoopResultBuilder]: For program point L7387-10(line 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,993 INFO L858 garLoopResultBuilder]: For program point L7387-17(line 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,993 INFO L858 garLoopResultBuilder]: For program point L7387-16(line 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,993 INFO L858 garLoopResultBuilder]: For program point L7387-14(line 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,993 INFO L858 garLoopResultBuilder]: For program point L7387-20(line 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,993 INFO L858 garLoopResultBuilder]: For program point L7387-18(line 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,993 INFO L858 garLoopResultBuilder]: For program point L7387-23(line 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,993 INFO L858 garLoopResultBuilder]: For program point L7387-22(line 7387) no Hoare annotation was computed. [2021-11-02 13:12:05,993 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-11-02 13:12:05,993 INFO L861 garLoopResultBuilder]: At program point L8974(line 8974) the Hoare annotation is: true [2021-11-02 13:12:05,994 INFO L854 garLoopResultBuilder]: At program point L6886(lines 6882 6887) the Hoare annotation is: (and (not (= (_ bv0 64) |ULTIMATE.start_bounded_malloc_#res.base|)) (bvule ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 (_ bv36028797018963967 64)) (= (_ bv1 8) ULTIMATE.start_assume_abort_if_not_~cond)) [2021-11-02 13:12:05,994 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-02 13:12:05,994 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:12:05,994 INFO L854 garLoopResultBuilder]: At program point L8257(lines 8251 8258) the Hoare annotation is: (let ((.cse5 (= (_ bv0 64) ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse6 (= (_ bv1 8) ULTIMATE.start___VERIFIER_assert_~cond)) (.cse7 (= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| (_ bv1 8))) (.cse8 (not (= (_ bv0 64) |ULTIMATE.start_bounded_malloc_#res.base|))) (.cse12 (= (_ bv0 64) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset|)) (.cse13 (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (_ bv8 64))))) (.cse18 (not (= (_ bv0 64) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|))) (.cse19 (= ULTIMATE.start_aws_byte_cursor_from_array_~len ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2)) (.cse20 (not (= (_ bv0 64) ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base)))) (or (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42| (_ BitVec 64)) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv8 64) |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42|))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42|) .cse2)) (.cse1 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42|) .cse2))) (and (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.offset .cse0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.offset| .cse0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.base| .cse1) (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base .cse1))))) (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31| (_ BitVec 64))) (let ((.cse4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31|) (_ bv8 64))) (.cse3 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31|) (_ bv8 64)))) (and (or (not (= (_ bv0 64) .cse3)) (not (= (_ bv0 64) .cse4))) (= .cse4 |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.offset| .cse3)))) .cse5 .cse6 .cse7 .cse8 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38| (_ BitVec 64)) (|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38| (_ BitVec 64))) (let ((.cse11 (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38|))) (let ((.cse9 (select .cse11 |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38|)) (.cse10 (select .cse11 (bvadd |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38| (_ bv4 64))))) (and (= ((_ extract 31 0) ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) .cse9) (= (concat .cse10 .cse9) |ULTIMATE.start_aws_byte_cursor_from_array_#res.len|) (= ((_ extract 63 32) ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) .cse10))))) .cse12 .cse13 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25| (_ BitVec 64)) (ULTIMATE.start_aws_byte_cursor_from_array_~len (_ BitVec 64))) (let ((.cse17 (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25|))) (let ((.cse16 (select .cse17 (_ bv4 64))) (.cse14 (select .cse17 (_ bv0 64)))) (let ((.cse15 (concat .cse16 .cse14))) (and (= ((_ extract 31 0) ULTIMATE.start_aws_byte_cursor_from_array_~len) .cse14) (not (= (_ bv0 64) .cse15)) (= .cse15 |ULTIMATE.start_aws_byte_cursor_from_array_#res.len|) (bvule ULTIMATE.start_aws_byte_cursor_from_array_~len (_ bv36028797018963967 64)) (= ((_ extract 63 32) ULTIMATE.start_aws_byte_cursor_from_array_~len) .cse16)))))) .cse18 .cse19 (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.offset ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.offset) .cse20) (and .cse5 (not (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base (_ bv0 64))) .cse6 .cse7 .cse8 .cse12 .cse13 .cse18 .cse19 .cse20 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15| (_ BitVec 64))) (let ((.cse24 (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15|))) (let ((.cse21 (select .cse24 (_ bv4 64))) (.cse22 (select .cse24 (_ bv0 64)))) (let ((.cse23 (concat .cse21 .cse22))) (and (= ((_ extract 63 32) ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) .cse21) (= ((_ extract 31 0) ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) .cse22) (= (_ bv0 64) .cse23) (= .cse23 |ULTIMATE.start_aws_byte_cursor_from_array_#res.len|))))))))) [2021-11-02 13:12:05,994 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:12:05,994 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:12:05,994 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 7101 7111) no Hoare annotation was computed. [2021-11-02 13:12:05,995 INFO L858 garLoopResultBuilder]: For program point L8959(lines 8959 8973) no Hoare annotation was computed. [2021-11-02 13:12:05,995 INFO L858 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-02 13:12:05,995 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:12:05,995 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-02 13:12:05,995 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-02 13:12:05,995 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-02 13:12:05,995 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-02 13:12:05,995 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-02 13:12:05,995 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-02 13:12:05,995 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-02 13:12:05,996 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-02 13:12:05,996 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-02 13:12:05,996 INFO L858 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-02 13:12:05,996 INFO L858 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-02 13:12:05,996 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 13:12:05,996 INFO L858 garLoopResultBuilder]: For program point L8970(lines 8970 8972) no Hoare annotation was computed. [2021-11-02 13:12:05,996 INFO L854 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (and (not (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base (_ bv0 64))) (= ULTIMATE.start_assert_bytes_match_~a.base ULTIMATE.start_assert_bytes_match_~b.base) (= (_ bv1 8) ULTIMATE.start___VERIFIER_assert_~cond) (not (= (_ bv0 64) |ULTIMATE.start_bounded_malloc_#res.base|)) (= ULTIMATE.start_assert_bytes_match_~a.offset ULTIMATE.start_assert_bytes_match_~b.offset) (not (= (_ bv0 64) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|)) (not (= (_ bv0 64) ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base)) (let ((.cse0 (bvadd (_ bv8 64) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset|))) (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) .cse0))) (and (= (_ bv0 64) |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1406.offset|) (= (_ bv0 64) |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1406.base|)) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) .cse0)))))) [2021-11-02 13:12:05,996 INFO L858 garLoopResultBuilder]: For program point L8970-2(lines 8970 8972) no Hoare annotation was computed. [2021-11-02 13:12:05,999 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 13:12:06,000 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 13:12:06,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,023 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] [2021-11-02 13:12:06,023 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] [2021-11-02 13:12:06,023 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled [2021-11-02 13:12:06,023 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,023 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] [2021-11-02 13:12:06,024 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] [2021-11-02 13:12:06,024 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled [2021-11-02 13:12:06,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,024 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] [2021-11-02 13:12:06,024 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] [2021-11-02 13:12:06,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,025 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] [2021-11-02 13:12:06,025 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] [2021-11-02 13:12:06,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,025 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] [2021-11-02 13:12:06,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,026 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] [2021-11-02 13:12:06,026 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,026 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] [2021-11-02 13:12:06,026 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled [2021-11-02 13:12:06,026 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled [2021-11-02 13:12:06,026 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] [2021-11-02 13:12:06,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,028 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,028 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,028 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,028 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-02 13:12:06,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-02 13:12:06,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-02 13:12:06,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,031 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,032 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] [2021-11-02 13:12:06,032 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] [2021-11-02 13:12:06,033 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled [2021-11-02 13:12:06,033 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,033 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] [2021-11-02 13:12:06,033 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] [2021-11-02 13:12:06,033 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled [2021-11-02 13:12:06,033 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,033 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] [2021-11-02 13:12:06,034 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] [2021-11-02 13:12:06,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,034 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] [2021-11-02 13:12:06,034 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] [2021-11-02 13:12:06,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,034 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] [2021-11-02 13:12:06,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,035 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] [2021-11-02 13:12:06,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,035 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] [2021-11-02 13:12:06,035 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled [2021-11-02 13:12:06,035 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled [2021-11-02 13:12:06,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,035 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] [2021-11-02 13:12:06,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,037 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-02 13:12:06,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-02 13:12:06,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-02 13:12:06,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,038 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,039 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,039 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,043 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,043 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,044 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,044 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,044 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,044 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,044 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,044 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,044 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,044 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,045 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,045 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,045 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,045 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,045 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,045 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,045 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,046 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,046 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,046 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,046 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,046 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,047 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,047 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,047 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,047 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,047 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,048 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,048 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,048 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,048 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,048 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,048 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,048 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,049 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,049 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,049 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,049 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,049 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,049 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,050 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,050 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 01:12:06 BoogieIcfgContainer [2021-11-02 13:12:06,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 13:12:06,052 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 13:12:06,052 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 13:12:06,052 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 13:12:06,052 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:07:09" (3/4) ... [2021-11-02 13:12:06,054 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-02 13:12:06,067 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2021-11-02 13:12:06,068 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2021-11-02 13:12:06,068 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-11-02 13:12:06,069 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-02 13:12:06,070 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-02 13:12:06,070 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-02 13:12:06,071 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-02 13:12:06,072 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-02 13:12:06,091 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv64 == \result) && ~bvule64(length, 36028797018963967bv64)) && 1bv8 == cond [2021-11-02 13:12:06,093 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((0bv64 == cursor && length[63:32] == unknown-#memory_int-unknown[cur][~bvadd16(cur, 4bv64)]) && !(array == 0bv64)) && \result == 1bv8) && !(0bv64 == \result)) && 0bv64 == cur) && !(0bv64 == #memory_$Pointer$[cursor][8bv64])) && !(0bv64 == cur)) && cur == 0bv64) && len == length) && cursor == cur) && unknown-#memory_int-unknown[cur][~bvadd16(cur, 4bv64)] ++ unknown-#memory_int-unknown[cur][cur] == 0bv64) && !(0bv64 == bytes)) && length[31:0] == unknown-#memory_int-unknown[cur][cur]) || (((((((((((((((array == bytes && 0bv64 == cursor) && length[63:32] == unknown-#memory_int-unknown[cur][~bvadd16(cur, 4bv64)]) && \result == 1bv8) && !(0bv64 == \result)) && array == #memory_$Pointer$[cur][~bvadd16(cur, 8bv64)]) && 0bv64 == cur) && ~bvule64(length, 36028797018963967bv64)) && array == #memory_$Pointer$[cur][~bvadd16(cur, 8bv64)]) && !(0bv64 == cur)) && cur == 0bv64) && len == length) && bytes == array) && cursor == cur) && !(0bv64 == bytes)) && length[31:0] == unknown-#memory_int-unknown[cur][cur]) [2021-11-02 13:12:06,093 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42 : bv64, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42 : bv64 :: ((array == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42][~bvadd16(8bv64, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42)] && aws_byte_cursor_from_array_#res.ptr == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42][~bvadd16(8bv64, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42)]) && aws_byte_cursor_from_array_#res.ptr == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42][~bvadd16(8bv64, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42)]) && array == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42][~bvadd16(8bv64, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42)]) && array == bytes) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31 : bv64 :: ((!(0bv64 == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31][8bv64]) || !(0bv64 == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31][8bv64])) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31][8bv64] == aws_byte_cursor_from_array_#res.ptr) && aws_byte_cursor_from_array_#res.ptr == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31][8bv64])) && 0bv64 == cursor) && 1bv8 == cond) && \result == 1bv8) && !(0bv64 == \result)) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38 : bv64, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38 : bv64 :: (length[31:0] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38] && unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][~bvadd16(v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38, 4bv64)] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38] == unknown-#res!len-unknown) && length[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][~bvadd16(v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38, 4bv64)])) && 0bv64 == cur) && !(0bv64 == #memory_$Pointer$[cursor][8bv64])) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25 : bv64, ULTIMATE.start_aws_byte_cursor_from_array_~len : bv64 :: (((ULTIMATE.start_aws_byte_cursor_from_array_~len[31:0] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25][0bv64] && !(0bv64 == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25][4bv64] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25][0bv64])) && unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25][4bv64] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25][0bv64] == unknown-#res!len-unknown) && ~bvule64(ULTIMATE.start_aws_byte_cursor_from_array_~len, 36028797018963967bv64)) && ULTIMATE.start_aws_byte_cursor_from_array_~len[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25][4bv64])) && !(0bv64 == cur)) && len == length) && bytes == array) && !(0bv64 == bytes)) || ((((((((((0bv64 == cursor && !(array == 0bv64)) && 1bv8 == cond) && \result == 1bv8) && !(0bv64 == \result)) && 0bv64 == cur) && !(0bv64 == #memory_$Pointer$[cursor][8bv64])) && !(0bv64 == cur)) && len == length) && !(0bv64 == bytes)) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15 : bv64 :: ((length[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][4bv64] && length[31:0] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][0bv64]) && 0bv64 == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][4bv64] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][0bv64]) && unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][4bv64] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][0bv64] == unknown-#res!len-unknown)) [2021-11-02 13:12:06,094 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(array == 0bv64) && 1bv8 == cond) && \result == 1bv8) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38 : bv64, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38 : bv64 :: ((length[31:0] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38] && unknown-#memory_int-unknown[cur][~bvadd16(cur, 4bv64)] == (unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][~bvadd16(v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38, 4bv64)] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38])[63:32]) && (unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][~bvadd16(v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38, 4bv64)] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38])[31:0] == unknown-#memory_int-unknown[cur][cur]) && length[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][~bvadd16(v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38, 4bv64)])) && !(0bv64 == \result)) && array == #memory_$Pointer$[cur][~bvadd16(8bv64, cur)]) && ~bvule64(length, 36028797018963967bv64)) && !(0bv64 == cur)) && array == #memory_$Pointer$[cur][~bvadd16(8bv64, cur)]) && !(0bv64 == bytes)) || ((((((!(array == 0bv64) && 1bv8 == cond) && \result == 1bv8) && !(0bv64 == \result)) && !(0bv64 == cur)) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15 : bv64 :: (((length[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][4bv64] && (unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][4bv64] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][0bv64])[63:32] == unknown-#memory_int-unknown[cur][~bvadd16(cur, 4bv64)]) && length[31:0] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][0bv64]) && 0bv64 == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][4bv64] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][0bv64]) && (unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][4bv64] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][0bv64])[31:0] == unknown-#memory_int-unknown[cur][cur])) && !(0bv64 == bytes)) [2021-11-02 13:12:06,098 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(array == 0bv64) && a == b) && 1bv8 == cond) && !(0bv64 == \result)) && a == b) && !(0bv64 == cur)) && !(0bv64 == bytes)) && ((!(0bv64 == #memory_$Pointer$[cur][~bvadd16(8bv64, cur)]) || (0bv64 == cur.ptr && 0bv64 == cur.ptr)) || !(0bv64 == #memory_$Pointer$[cur][~bvadd16(8bv64, cur)])) [2021-11-02 13:12:06,646 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-02 13:12:06,647 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 13:12:06,647 INFO L158 Benchmark]: Toolchain (without parser) took 305163.58ms. Allocated memory was 54.5MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 33.7MB in the beginning and 546.6MB in the end (delta: -512.9MB). Peak memory consumption was 887.1MB. Max. memory is 16.1GB. [2021-11-02 13:12:06,647 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory was 36.5MB in the beginning and 36.4MB in the end (delta: 33.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 13:12:06,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1741.33ms. Allocated memory was 54.5MB in the beginning and 121.6MB in the end (delta: 67.1MB). Free memory was 33.4MB in the beginning and 57.9MB in the end (delta: -24.4MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2021-11-02 13:12:06,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 151.08ms. Allocated memory is still 121.6MB. Free memory was 57.9MB in the beginning and 46.6MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-02 13:12:06,648 INFO L158 Benchmark]: Boogie Preprocessor took 68.91ms. Allocated memory is still 121.6MB. Free memory was 46.6MB in the beginning and 36.8MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-02 13:12:06,648 INFO L158 Benchmark]: RCFGBuilder took 6109.36ms. Allocated memory was 121.6MB in the beginning and 939.5MB in the end (delta: 817.9MB). Free memory was 36.8MB in the beginning and 869.2MB in the end (delta: -832.3MB). Peak memory consumption was 534.3MB. Max. memory is 16.1GB. [2021-11-02 13:12:06,648 INFO L158 Benchmark]: TraceAbstraction took 296491.86ms. Allocated memory was 939.5MB in the beginning and 1.4GB in the end (delta: 440.4MB). Free memory was 868.1MB in the beginning and 561.2MB in the end (delta: 306.9MB). Peak memory consumption was 748.3MB. Max. memory is 16.1GB. [2021-11-02 13:12:06,649 INFO L158 Benchmark]: Witness Printer took 595.25ms. Allocated memory is still 1.4GB. Free memory was 561.2MB in the beginning and 546.6MB in the end (delta: 14.7MB). Peak memory consumption was 89.1MB. Max. memory is 16.1GB. [2021-11-02 13:12:06,649 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 54.5MB. Free memory was 36.5MB in the beginning and 36.4MB in the end (delta: 33.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1741.33ms. Allocated memory was 54.5MB in the beginning and 121.6MB in the end (delta: 67.1MB). Free memory was 33.4MB in the beginning and 57.9MB in the end (delta: -24.4MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 151.08ms. Allocated memory is still 121.6MB. Free memory was 57.9MB in the beginning and 46.6MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.91ms. Allocated memory is still 121.6MB. Free memory was 46.6MB in the beginning and 36.8MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 6109.36ms. Allocated memory was 121.6MB in the beginning and 939.5MB in the end (delta: 817.9MB). Free memory was 36.8MB in the beginning and 869.2MB in the end (delta: -832.3MB). Peak memory consumption was 534.3MB. Max. memory is 16.1GB. * TraceAbstraction took 296491.86ms. Allocated memory was 939.5MB in the beginning and 1.4GB in the end (delta: 440.4MB). Free memory was 868.1MB in the beginning and 561.2MB in the end (delta: 306.9MB). Peak memory consumption was 748.3MB. Max. memory is 16.1GB. * Witness Printer took 595.25ms. Allocated memory is still 1.4GB. Free memory was 561.2MB in the beginning and 546.6MB in the end (delta: 14.7MB). Peak memory consumption was 89.1MB. 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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms 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 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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 1 procedures, 60 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 296390.35ms, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 14.60ms, AutomataDifference: 66149.24ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 3557.01ms, InitialAbstractionConstructionTime: 7.09ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 17 mSolverCounterUnknown, 929 SdHoareTripleChecker+Valid, 54728.96ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 929 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 52304.66ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1150 IncrementalHoareTripleChecker+Unchecked, 3083 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4259 IncrementalHoareTripleChecker+Invalid, 5579 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 0 mSDtfsCounter, 4259 mSolverCounterSat, 67.98ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 892 GetRequests, 643 SyntacticMatches, 3 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 28061.32ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=9, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 89.80ms AutomataMinimizationTime, 17 MinimizatonAttempts, 116 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 699 HoareAnnotationTreeSize, 6 FomulaSimplifications, 759 FormulaSimplificationTreeSizeReduction, 141.37ms HoareSimplificationTime, 6 FomulaSimplificationsInter, 446 FormulaSimplificationTreeSizeReductionInter, 3407.88ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1399.49ms SsaConstructionTime, 129274.90ms SatisfiabilityAnalysisTime, 90408.09ms InterpolantComputationTime, 417 NumberOfCodeBlocks, 417 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 800 ConstructedInterpolants, 173 QuantifiedInterpolants, 13481 SizeOfPredicates, 274 NumberOfNonLiveVariables, 26972 ConjunctsInSsa, 282 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 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 5 specifications checked. All of them hold - InvariantResult [Line: 266]: Loop Invariant [2021-11-02 13:12:06,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((!(array == 0bv64) && a == b) && 1bv8 == cond) && !(0bv64 == \result)) && a == b) && !(0bv64 == cur)) && !(0bv64 == bytes)) && ((!(0bv64 == #memory_$Pointer$[cur][~bvadd16(8bv64, cur)]) || (0bv64 == cur.ptr && 0bv64 == cur.ptr)) || !(0bv64 == #memory_$Pointer$[cur][~bvadd16(8bv64, cur)])) - InvariantResult [Line: 8974]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8251]: Loop Invariant [2021-11-02 13:12:06,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,668 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] [2021-11-02 13:12:06,669 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] [2021-11-02 13:12:06,669 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled [2021-11-02 13:12:06,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,669 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] [2021-11-02 13:12:06,669 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] [2021-11-02 13:12:06,669 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled [2021-11-02 13:12:06,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,669 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] [2021-11-02 13:12:06,670 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] [2021-11-02 13:12:06,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,670 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] [2021-11-02 13:12:06,670 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] [2021-11-02 13:12:06,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,670 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] [2021-11-02 13:12:06,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,670 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] [2021-11-02 13:12:06,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,671 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] [2021-11-02 13:12:06,671 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled [2021-11-02 13:12:06,671 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled [2021-11-02 13:12:06,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,671 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] [2021-11-02 13:12:06,671 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,671 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,672 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,672 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,672 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,672 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,672 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,672 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,672 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,672 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-02 13:12:06,672 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,673 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,673 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,673 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,673 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,673 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-02 13:12:06,673 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-02 13:12:06,673 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,673 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,675 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] [2021-11-02 13:12:06,675 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] [2021-11-02 13:12:06,675 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled [2021-11-02 13:12:06,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,676 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] [2021-11-02 13:12:06,676 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] [2021-11-02 13:12:06,676 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled [2021-11-02 13:12:06,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,676 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] [2021-11-02 13:12:06,676 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] [2021-11-02 13:12:06,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42,QUANTIFIED] [2021-11-02 13:12:06,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42,QUANTIFIED] [2021-11-02 13:12:06,677 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] [2021-11-02 13:12:06,677 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] [2021-11-02 13:12:06,677 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] [2021-11-02 13:12:06,678 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled [2021-11-02 13:12:06,678 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : C_LONG, ptr : $Pointer$ } not handled [2021-11-02 13:12:06,678 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31,QUANTIFIED] [2021-11-02 13:12:06,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,679 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,679 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,679 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,679 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,679 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-02 13:12:06,679 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,679 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,680 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,680 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,680 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,680 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-02 13:12:06,680 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-02 13:12:06,680 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25,QUANTIFIED] [2021-11-02 13:12:06,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,680 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,680 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,681 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,681 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,681 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,681 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] Derived loop invariant: (((((((((((((((\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42 : bv64, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42 : bv64 :: ((array == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42][~bvadd16(8bv64, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42)] && aws_byte_cursor_from_array_#res.ptr == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42][~bvadd16(8bv64, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42)]) && aws_byte_cursor_from_array_#res.ptr == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42][~bvadd16(8bv64, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42)]) && array == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_42][~bvadd16(8bv64, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_42)]) && array == bytes) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31 : bv64 :: ((!(0bv64 == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31][8bv64]) || !(0bv64 == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31][8bv64])) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31][8bv64] == aws_byte_cursor_from_array_#res.ptr) && aws_byte_cursor_from_array_#res.ptr == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_31][8bv64])) && 0bv64 == cursor) && 1bv8 == cond) && \result == 1bv8) && !(0bv64 == \result)) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38 : bv64, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38 : bv64 :: (length[31:0] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38] && unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][~bvadd16(v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38, 4bv64)] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38] == unknown-#res!len-unknown) && length[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][~bvadd16(v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38, 4bv64)])) && 0bv64 == cur) && !(0bv64 == #memory_$Pointer$[cursor][8bv64])) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25 : bv64, ULTIMATE.start_aws_byte_cursor_from_array_~len : bv64 :: (((ULTIMATE.start_aws_byte_cursor_from_array_~len[31:0] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25][0bv64] && !(0bv64 == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25][4bv64] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25][0bv64])) && unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25][4bv64] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25][0bv64] == unknown-#res!len-unknown) && ~bvule64(ULTIMATE.start_aws_byte_cursor_from_array_~len, 36028797018963967bv64)) && ULTIMATE.start_aws_byte_cursor_from_array_~len[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_25][4bv64])) && !(0bv64 == cur)) && len == length) && bytes == array) && !(0bv64 == bytes)) || ((((((((((0bv64 == cursor && !(array == 0bv64)) && 1bv8 == cond) && \result == 1bv8) && !(0bv64 == \result)) && 0bv64 == cur) && !(0bv64 == #memory_$Pointer$[cursor][8bv64])) && !(0bv64 == cur)) && len == length) && !(0bv64 == bytes)) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15 : bv64 :: ((length[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][4bv64] && length[31:0] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][0bv64]) && 0bv64 == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][4bv64] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][0bv64]) && unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][4bv64] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][0bv64] == unknown-#res!len-unknown)) - InvariantResult [Line: 7384]: Loop Invariant [2021-11-02 13:12:06,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((0bv64 == cursor && length[63:32] == unknown-#memory_int-unknown[cur][~bvadd16(cur, 4bv64)]) && !(array == 0bv64)) && \result == 1bv8) && !(0bv64 == \result)) && 0bv64 == cur) && !(0bv64 == #memory_$Pointer$[cursor][8bv64])) && !(0bv64 == cur)) && cur == 0bv64) && len == length) && cursor == cur) && unknown-#memory_int-unknown[cur][~bvadd16(cur, 4bv64)] ++ unknown-#memory_int-unknown[cur][cur] == 0bv64) && !(0bv64 == bytes)) && length[31:0] == unknown-#memory_int-unknown[cur][cur]) || (((((((((((((((array == bytes && 0bv64 == cursor) && length[63:32] == unknown-#memory_int-unknown[cur][~bvadd16(cur, 4bv64)]) && \result == 1bv8) && !(0bv64 == \result)) && array == #memory_$Pointer$[cur][~bvadd16(cur, 8bv64)]) && 0bv64 == cur) && ~bvule64(length, 36028797018963967bv64)) && array == #memory_$Pointer$[cur][~bvadd16(cur, 8bv64)]) && !(0bv64 == cur)) && cur == 0bv64) && len == length) && bytes == array) && cursor == cur) && !(0bv64 == bytes)) && length[31:0] == unknown-#memory_int-unknown[cur][cur]) - InvariantResult [Line: 7384]: Loop Invariant [2021-11-02 13:12:06,683 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,684 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,684 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,684 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,684 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,684 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,684 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,684 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,684 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,684 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,685 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,685 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,685 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,685 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,685 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,685 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,685 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,686 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,686 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,686 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,686 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,686 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38,QUANTIFIED] [2021-11-02 13:12:06,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38,QUANTIFIED] [2021-11-02 13:12:06,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-02 13:12:06,688 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-02 13:12:06,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,689 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,689 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] [2021-11-02 13:12:06,689 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15,QUANTIFIED] Derived loop invariant: (((((((((!(array == 0bv64) && 1bv8 == cond) && \result == 1bv8) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38 : bv64, v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38 : bv64 :: ((length[31:0] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38] && unknown-#memory_int-unknown[cur][~bvadd16(cur, 4bv64)] == (unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][~bvadd16(v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38, 4bv64)] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38])[63:32]) && (unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][~bvadd16(v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38, 4bv64)] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38])[31:0] == unknown-#memory_int-unknown[cur][cur]) && length[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_38][~bvadd16(v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset_38, 4bv64)])) && !(0bv64 == \result)) && array == #memory_$Pointer$[cur][~bvadd16(8bv64, cur)]) && ~bvule64(length, 36028797018963967bv64)) && !(0bv64 == cur)) && array == #memory_$Pointer$[cur][~bvadd16(8bv64, cur)]) && !(0bv64 == bytes)) || ((((((!(array == 0bv64) && 1bv8 == cond) && \result == 1bv8) && !(0bv64 == \result)) && !(0bv64 == cur)) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15 : bv64 :: (((length[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][4bv64] && (unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][4bv64] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][0bv64])[63:32] == unknown-#memory_int-unknown[cur][~bvadd16(cur, 4bv64)]) && length[31:0] == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][0bv64]) && 0bv64 == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][4bv64] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][0bv64]) && (unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][4bv64] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base_15][0bv64])[31:0] == unknown-#memory_int-unknown[cur][cur])) && !(0bv64 == bytes)) - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: (!(0bv64 == \result) && ~bvule64(length, 36028797018963967bv64)) && 1bv8 == cond RESULT: Ultimate proved your program to be correct! [2021-11-02 13:12:06,853 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