./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 bfd0d9ac 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 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-bfd0d9a [2021-11-01 10:02:15,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-01 10:02:15,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-01 10:02:15,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-01 10:02:15,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-01 10:02:15,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-01 10:02:15,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-01 10:02:15,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-01 10:02:15,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-01 10:02:15,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-01 10:02:15,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-01 10:02:15,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-01 10:02:15,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-01 10:02:15,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-01 10:02:15,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-01 10:02:15,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-01 10:02:15,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-01 10:02:15,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-01 10:02:15,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-01 10:02:15,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-01 10:02:15,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-01 10:02:15,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-01 10:02:15,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-01 10:02:15,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-01 10:02:15,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-01 10:02:15,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-01 10:02:15,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-01 10:02:15,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-01 10:02:15,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-01 10:02:15,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-01 10:02:15,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-01 10:02:15,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-01 10:02:15,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-01 10:02:15,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-01 10:02:15,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-01 10:02:15,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-01 10:02:15,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-01 10:02:15,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-01 10:02:15,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-01 10:02:15,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-01 10:02:15,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-01 10:02:15,376 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-01 10:02:15,402 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-01 10:02:15,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-01 10:02:15,403 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-01 10:02:15,403 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-01 10:02:15,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-01 10:02:15,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-01 10:02:15,404 INFO L138 SettingsManager]: * Use SBE=true [2021-11-01 10:02:15,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-01 10:02:15,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-01 10:02:15,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-01 10:02:15,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-01 10:02:15,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-01 10:02:15,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-01 10:02:15,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-01 10:02:15,406 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-01 10:02:15,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-01 10:02:15,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-01 10:02:15,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-01 10:02:15,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-01 10:02:15,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-01 10:02:15,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-01 10:02:15,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-01 10:02:15,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-01 10:02:15,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-01 10:02:15,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-01 10:02:15,408 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-01 10:02:15,408 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-01 10:02:15,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-01 10:02:15,408 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-01 10:02:15,408 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-01 10:02:15,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-01 10:02:15,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-01 10:02:15,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-01 10:02:15,640 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-01 10:02:15,641 INFO L275 PluginConnector]: CDTParser initialized [2021-11-01 10:02:15,642 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-01 10:02:15,690 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a754fce1/8673be279e674e3e9e7954b279290993/FLAG4995a90c0 [2021-11-01 10:02:16,254 INFO L306 CDTParser]: Found 1 translation units. [2021-11-01 10:02:16,254 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2021-11-01 10:02:16,284 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a754fce1/8673be279e674e3e9e7954b279290993/FLAG4995a90c0 [2021-11-01 10:02:16,721 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a754fce1/8673be279e674e3e9e7954b279290993 [2021-11-01 10:02:16,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-01 10:02:16,724 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-01 10:02:16,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-01 10:02:16,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-01 10:02:16,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-01 10:02:16,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 10:02:16" (1/1) ... [2021-11-01 10:02:16,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bdc0842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:16, skipping insertion in model container [2021-11-01 10:02:16,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 10:02:16" (1/1) ... [2021-11-01 10:02:16,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-01 10:02:16,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-01 10:02:17,000 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-01 10:02:17,005 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-01 10:02:17,027 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-01 10:02:17,033 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-01 10:02:17,577 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:17,578 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:17,578 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:17,579 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:17,580 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:17,601 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:17,601 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:17,603 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:17,604 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:17,831 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-01 10:02:17,832 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-01 10:02:17,833 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-01 10:02:17,834 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-01 10:02:17,840 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-01 10:02:17,842 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-01 10:02:17,843 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-01 10:02:17,843 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-01 10:02:17,843 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-01 10:02:17,844 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-01 10:02:17,927 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-01 10:02:17,985 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:17,985 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:18,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-01 10:02:18,108 INFO L203 MainTranslator]: Completed pre-run [2021-11-01 10:02:18,121 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-01 10:02:18,122 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-01 10:02:18,123 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-01 10:02:18,124 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-01 10:02:18,143 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:18,143 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:18,143 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:18,143 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:18,144 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:18,147 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:18,147 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:18,148 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:18,148 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:18,178 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-01 10:02:18,179 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-01 10:02:18,179 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-01 10:02:18,179 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-01 10:02:18,180 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-01 10:02:18,180 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-01 10:02:18,180 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-01 10:02:18,181 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-01 10:02:18,181 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-01 10:02:18,181 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-01 10:02:18,192 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-01 10:02:18,220 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:18,220 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:18,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-01 10:02:18,373 INFO L208 MainTranslator]: Completed translation [2021-11-01 10:02:18,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:18 WrapperNode [2021-11-01 10:02:18,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-01 10:02:18,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-01 10:02:18,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-01 10:02:18,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-01 10:02:18,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:18" (1/1) ... [2021-11-01 10:02:18,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:18" (1/1) ... [2021-11-01 10:02:18,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-01 10:02:18,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-01 10:02:18,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-01 10:02:18,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-01 10:02:18,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:18" (1/1) ... [2021-11-01 10:02:18,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:18" (1/1) ... [2021-11-01 10:02:18,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:18" (1/1) ... [2021-11-01 10:02:18,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:18" (1/1) ... [2021-11-01 10:02:18,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:18" (1/1) ... [2021-11-01 10:02:18,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:18" (1/1) ... [2021-11-01 10:02:18,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:18" (1/1) ... [2021-11-01 10:02:18,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-01 10:02:18,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-01 10:02:18,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-01 10:02:18,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-01 10:02:18,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:18" (1/1) ... [2021-11-01 10:02:18,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-01 10:02:18,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 10:02:18,622 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-01 10:02:18,637 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-01 10:02:18,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-01 10:02:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-01 10:02:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-01 10:02:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-01 10:02:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-01 10:02:18,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-01 10:02:18,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-01 10:02:18,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-01 10:02:18,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-01 10:02:18,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-01 10:02:18,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-01 10:02:23,016 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-01 10:02:23,016 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2021-11-01 10:02:23,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 10:02:23 BoogieIcfgContainer [2021-11-01 10:02:23,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-01 10:02:23,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-01 10:02:23,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-01 10:02:23,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-01 10:02:23,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 10:02:16" (1/3) ... [2021-11-01 10:02:23,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4166179a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 10:02:23, skipping insertion in model container [2021-11-01 10:02:23,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:18" (2/3) ... [2021-11-01 10:02:23,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4166179a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 10:02:23, skipping insertion in model container [2021-11-01 10:02:23,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 10:02:23" (3/3) ... [2021-11-01 10:02:23,026 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_array_harness.i [2021-11-01 10:02:23,030 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-01 10:02:23,030 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-01 10:02:23,062 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-01 10:02:23,069 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-01 10:02:23,069 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-01 10:02:23,089 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-01 10:02:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-01 10:02:23,092 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:02:23,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:02:23,093 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-01 10:02:23,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:02:23,097 INFO L85 PathProgramCache]: Analyzing trace with hash -86834800, now seen corresponding path program 1 times [2021-11-01 10:02:23,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:02:23,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032806744] [2021-11-01 10:02:23,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:02:23,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:02:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:02:23,594 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-01 10:02:23,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:02:23,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032806744] [2021-11-01 10:02:23,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032806744] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:02:23,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:02:23,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-01 10:02:23,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368239009] [2021-11-01 10:02:23,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-01 10:02:23,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:02:23,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-01 10:02:23,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-01 10:02:23,620 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-01 10:02:25,697 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:02:26,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:02:26,183 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2021-11-01 10:02:26,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-01 10:02:26,185 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-01 10:02:26,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:02:26,189 INFO L225 Difference]: With dead ends: 117 [2021-11-01 10:02:26,190 INFO L226 Difference]: Without dead ends: 53 [2021-11-01 10:02:26,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.02ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-01 10:02:26,193 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2312.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.29ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2529.51ms IncrementalHoareTripleChecker+Time [2021-11-01 10:02:26,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 71 Unknown, 0 Unchecked, 1.29ms Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 1 Unknown, 0 Unchecked, 2529.51ms Time] [2021-11-01 10:02:26,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-01 10:02:26,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-11-01 10:02:26,242 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-01 10:02:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2021-11-01 10:02:26,243 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 12 [2021-11-01 10:02:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:02:26,244 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2021-11-01 10:02:26,244 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-01 10:02:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2021-11-01 10:02:26,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-01 10:02:26,244 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:02:26,244 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:02:26,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-01 10:02:26,245 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-01 10:02:26,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:02:26,245 INFO L85 PathProgramCache]: Analyzing trace with hash -479861810, now seen corresponding path program 1 times [2021-11-01 10:02:26,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:02:26,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940464100] [2021-11-01 10:02:26,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:02:26,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:02:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:02:26,420 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-01 10:02:26,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:02:26,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940464100] [2021-11-01 10:02:26,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940464100] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:02:26,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:02:26,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-01 10:02:26,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162940958] [2021-11-01 10:02:26,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 10:02:26,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:02:26,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 10:02:26,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 10:02:26,424 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-01 10:02:28,478 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-01 10:02:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:02:29,013 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2021-11-01 10:02:29,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 10:02:29,013 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-01 10:02:29,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:02:29,014 INFO L225 Difference]: With dead ends: 90 [2021-11-01 10:02:29,014 INFO L226 Difference]: Without dead ends: 53 [2021-11-01 10:02:29,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.69ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 10:02:29,015 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2337.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.24ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2568.68ms IncrementalHoareTripleChecker+Time [2021-11-01 10:02:29,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 97 Unknown, 0 Unchecked, 2.24ms Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 1 Unknown, 0 Unchecked, 2568.68ms Time] [2021-11-01 10:02:29,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-01 10:02:29,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-11-01 10:02:29,020 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-01 10:02:29,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2021-11-01 10:02:29,021 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 12 [2021-11-01 10:02:29,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:02:29,021 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2021-11-01 10:02:29,022 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-01 10:02:29,022 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2021-11-01 10:02:29,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-01 10:02:29,022 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:02:29,022 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:02:29,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-01 10:02:29,022 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-01 10:02:29,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:02:29,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1018024457, now seen corresponding path program 1 times [2021-11-01 10:02:29,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:02:29,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084800209] [2021-11-01 10:02:29,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:02:29,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:02:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:02:29,482 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-01 10:02:29,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:02:29,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084800209] [2021-11-01 10:02:29,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084800209] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:02:29,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:02:29,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-01 10:02:29,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687859708] [2021-11-01 10:02:29,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-01 10:02:29,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:02:29,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-01 10:02:29,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-01 10:02:29,484 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-01 10:02:31,531 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-01 10:02:32,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:02:32,911 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2021-11-01 10:02:32,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-01 10:02:32,911 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-01 10:02:32,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:02:32,912 INFO L225 Difference]: With dead ends: 97 [2021-11-01 10:02:32,912 INFO L226 Difference]: Without dead ends: 93 [2021-11-01 10:02:32,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 252.51ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-01 10:02:32,915 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2882.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.07ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3260.69ms IncrementalHoareTripleChecker+Time [2021-11-01 10:02:32,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 361 Unknown, 0 Unchecked, 7.07ms Time], IncrementalHoareTripleChecker [17 Valid, 343 Invalid, 1 Unknown, 0 Unchecked, 3260.69ms Time] [2021-11-01 10:02:32,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-01 10:02:32,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 61. [2021-11-01 10:02:32,919 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-01 10:02:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2021-11-01 10:02:32,920 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 14 [2021-11-01 10:02:32,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:02:32,920 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2021-11-01 10:02:32,920 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-01 10:02:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2021-11-01 10:02:32,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-01 10:02:32,921 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:02:32,921 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-01 10:02:32,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-01 10:02:32,921 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-01 10:02:32,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:02:32,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1084310207, now seen corresponding path program 1 times [2021-11-01 10:02:32,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:02:32,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561476533] [2021-11-01 10:02:32,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:02:32,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:02:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:02:35,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-01 10:02:35,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:02:35,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561476533] [2021-11-01 10:02:35,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561476533] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:02:35,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:02:35,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-01 10:02:35,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912965264] [2021-11-01 10:02:35,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-01 10:02:35,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:02:35,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-01 10:02:35,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-01 10:02:35,009 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-01 10:02:37,057 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-01 10:02:38,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:02:38,526 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2021-11-01 10:02:38,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-01 10:02:38,527 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-01 10:02:38,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:02:38,528 INFO L225 Difference]: With dead ends: 111 [2021-11-01 10:02:38,528 INFO L226 Difference]: Without dead ends: 68 [2021-11-01 10:02:38,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 348.34ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-11-01 10:02:38,529 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2697.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.65ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3249.12ms IncrementalHoareTripleChecker+Time [2021-11-01 10:02:38,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 230 Unknown, 0 Unchecked, 5.65ms Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 1 Unknown, 0 Unchecked, 3249.12ms Time] [2021-11-01 10:02:38,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-01 10:02:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2021-11-01 10:02:38,534 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-01 10:02:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2021-11-01 10:02:38,534 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 18 [2021-11-01 10:02:38,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:02:38,535 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2021-11-01 10:02:38,535 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-01 10:02:38,535 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2021-11-01 10:02:38,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-01 10:02:38,535 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:02:38,535 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-01 10:02:38,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-01 10:02:38,536 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-01 10:02:38,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:02:38,536 INFO L85 PathProgramCache]: Analyzing trace with hash -404251837, now seen corresponding path program 1 times [2021-11-01 10:02:38,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:02:38,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351906891] [2021-11-01 10:02:38,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:02:38,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:02:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-01 10:02:40,892 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-01 10:02:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-01 10:02:43,299 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-01 10:02:43,300 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-01 10:02:43,300 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-11-01 10:02:43,302 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-11-01 10:02:43,302 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-11-01 10:02:43,302 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-11-01 10:02:43,302 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-11-01 10:02:43,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-01 10:02:43,306 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2021-11-01 10:02:43,308 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-01 10:02:43,327 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-01 10:02:43,328 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-01 10:02:43,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-01 10:02:43,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.base [2021-11-01 10:02:43,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-01 10:02:43,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.base [2021-11-01 10:02:43,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-01 10:02:43,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.offset [2021-11-01 10:02:43,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-01 10:02:43,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-01 10:02:43,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-01 10:02:43,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.base [2021-11-01 10:02:43,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-01 10:02:43,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.base [2021-11-01 10:02:43,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-01 10:02:43,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.offset [2021-11-01 10:02:43,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-01 10:02:43,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.offset [2021-11-01 10:02:43,339 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-01 10:02:43,339 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-01 10:02:43,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-01 10:02:43,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.base [2021-11-01 10:02:43,339 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-01 10:02:43,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.offset [2021-11-01 10:02:43,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-01 10:02:43,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-01 10:02:43,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-01 10:02:43,356 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-01 10:02:43,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-01 10:02:43,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-01 10:02:43,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-01 10:02:43,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-01 10:02:43,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-01 10:02:43,358 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-01 10:02:43,358 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-01 10:02:43,358 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-01 10:02:43,358 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-01 10:02:43,358 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-01 10:02:43,358 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-01 10:02:43,359 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-01 10:02:43,359 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-01 10:02:43,359 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-01 10:02:43,359 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-01 10:02:43,359 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-01 10:02:43,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-01 10:02:43,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.base [2021-11-01 10:02:43,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-01 10:02:43,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-01 10:02:43,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-01 10:02:43,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.offset [2021-11-01 10:02:43,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-01 10:02:43,361 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-01 10:02:43,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-01 10:02:43,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.base [2021-11-01 10:02:43,362 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-01 10:02:43,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.offset [2021-11-01 10:02:43,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-01 10:02:43,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.offset [2021-11-01 10:02:43,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-01 10:02:43,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.base [2021-11-01 10:02:43,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-01 10:02:43,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-01 10:02:43,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-01 10:02:43,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.offset [2021-11-01 10:02:43,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-01 10:02:43,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-01 10:02:43,365 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-01 10:02:43,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.base [2021-11-01 10:02:43,365 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-01 10:02:43,365 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-01 10:02:43,366 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-01 10:02:43,367 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-01 10:02:43,367 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-01 10:02:43,367 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-01 10:02:43,367 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-01 10:02:43,368 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-01 10:02:43,368 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-01 10:02:43,368 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-01 10:02:43,368 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-01 10:02:43,368 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-01 10:02:43,369 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-01 10:02:43,369 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-01 10:02:43,369 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-01 10:02:43,369 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-01 10:02:43,369 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-01 10:02:43,370 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-01 10:02:43,370 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-01 10:02:43,370 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-01 10:02:43,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-01 10:02:43,370 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-01 10:02:43,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-01 10:02:43,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-01 10:02:43,371 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-01 10:02:43,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-01 10:02:43,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-01 10:02:43,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.offset [2021-11-01 10:02:43,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-01 10:02:43,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-01 10:02:43,373 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-01 10:02:43,374 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-01 10:02:43,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-01 10:02:43,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-01 10:02:43,375 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-01 10:02:43,375 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-01 10:02:43,375 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-01 10:02:43,375 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-01 10:02:43,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-01 10:02:43,376 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-01 10:02:43,379 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-01 10:02:43,379 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-01 10:02:43,380 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-01 10:02:43,380 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-01 10:02:43,380 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-01 10:02:43,380 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-01 10:02:43,381 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-01 10:02:43,381 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-01 10:02:43,381 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-01 10:02:43,381 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-01 10:02:43,381 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-01 10:02:43,381 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-01 10:02:43,382 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-01 10:02:43,382 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-01 10:02:43,382 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-01 10:02:43,382 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-01 10:02:43,382 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-01 10:02:43,382 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-01 10:02:43,383 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-01 10:02:43,383 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-01 10:02:43,383 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-01 10:02:43,383 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-01 10:02:43,384 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-01 10:02:43,384 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-01 10:02:43,384 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-01 10:02:43,384 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-01 10:02:43,385 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-01 10:02:43,385 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-01 10:02:43,386 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-01 10:02:43,386 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-01 10:02:43,390 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-01 10:02:43,390 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-01 10:02:43,391 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-01 10:02:43,391 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-01 10:02:43,391 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-01 10:02:43,391 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-01 10:02:43,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 10:02:43 BoogieIcfgContainer [2021-11-01 10:02:43,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-01 10:02:43,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-01 10:02:43,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-01 10:02:43,535 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-01 10:02:43,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 10:02:23" (3/4) ... [2021-11-01 10:02:43,538 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-01 10:02:43,538 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-01 10:02:43,539 INFO L158 Benchmark]: Toolchain (without parser) took 26814.89ms. Allocated memory was 96.5MB in the beginning and 702.5MB in the end (delta: 606.1MB). Free memory was 58.4MB in the beginning and 572.6MB in the end (delta: -514.2MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. [2021-11-01 10:02:43,539 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-01 10:02:43,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1647.40ms. Allocated memory was 96.5MB in the beginning and 144.7MB in the end (delta: 48.2MB). Free memory was 58.2MB in the beginning and 85.2MB in the end (delta: -27.0MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2021-11-01 10:02:43,539 INFO L158 Benchmark]: Boogie Procedure Inliner took 135.29ms. Allocated memory is still 144.7MB. Free memory was 85.2MB in the beginning and 73.4MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-01 10:02:43,540 INFO L158 Benchmark]: Boogie Preprocessor took 88.36ms. Allocated memory is still 144.7MB. Free memory was 73.4MB in the beginning and 66.3MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-01 10:02:43,540 INFO L158 Benchmark]: RCFGBuilder took 4419.13ms. Allocated memory was 144.7MB in the beginning and 371.2MB in the end (delta: 226.5MB). Free memory was 66.3MB in the beginning and 178.1MB in the end (delta: -111.8MB). Peak memory consumption was 205.6MB. Max. memory is 16.1GB. [2021-11-01 10:02:43,540 INFO L158 Benchmark]: TraceAbstraction took 20515.69ms. Allocated memory was 371.2MB in the beginning and 702.5MB in the end (delta: 331.4MB). Free memory was 178.1MB in the beginning and 572.6MB in the end (delta: -394.5MB). Peak memory consumption was 140.3MB. Max. memory is 16.1GB. [2021-11-01 10:02:43,540 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 702.5MB. Free memory is still 572.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-01 10:02:43,542 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 96.5MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1647.40ms. Allocated memory was 96.5MB in the beginning and 144.7MB in the end (delta: 48.2MB). Free memory was 58.2MB in the beginning and 85.2MB in the end (delta: -27.0MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 135.29ms. Allocated memory is still 144.7MB. Free memory was 85.2MB in the beginning and 73.4MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.36ms. Allocated memory is still 144.7MB. Free memory was 73.4MB in the beginning and 66.3MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 4419.13ms. Allocated memory was 144.7MB in the beginning and 371.2MB in the end (delta: 226.5MB). Free memory was 66.3MB in the beginning and 178.1MB in the end (delta: -111.8MB). Peak memory consumption was 205.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20515.69ms. Allocated memory was 371.2MB in the beginning and 702.5MB in the end (delta: 331.4MB). Free memory was 178.1MB in the beginning and 572.6MB in the end (delta: -394.5MB). Peak memory consumption was 140.3MB. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 702.5MB. Free memory is still 572.6MB. 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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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.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={393:0}, s_common_log_subject_list=2, s_list={484:0}, s_list=46, 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=46, s_list={484:0}, 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={393:0}, s_common_log_subject_list=2, s_list={484:0}, s_list=46, 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=2, s_common_log_subject_list={393:0}, s_list=46, s_list={484:0}, 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=46, s_list={484:0}, 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={484:0}, s_list=46, 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=2, s_common_log_subject_list={393:0}, s_list=46, s_list={484:0}, 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={484:0}, s_list=46, 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: 20245.68ms, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 12.21ms, AutomataDifference: 12142.53ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 11.89ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 252 SdHoareTripleChecker+Valid, 11607.99ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 10229.67ms 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, 16.25ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 614.56ms 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: 54.04ms AutomataMinimizationTime, 4 MinimizatonAttempts, 37 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 73.61ms SsaConstructionTime, 4590.27ms SatisfiabilityAnalysisTime, 784.31ms 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-01 10:02:43,642 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... ### Bit-precise run ### This is Ultimate 0.2.1-wip.dd.seqcomp-bfd0d9a [2021-11-01 10:02:45,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-01 10:02:45,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-01 10:02:45,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-01 10:02:45,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-01 10:02:45,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-01 10:02:45,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-01 10:02:45,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-01 10:02:45,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-01 10:02:45,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-01 10:02:45,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-01 10:02:45,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-01 10:02:45,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-01 10:02:45,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-01 10:02:45,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-01 10:02:45,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-01 10:02:45,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-01 10:02:45,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-01 10:02:45,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-01 10:02:45,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-01 10:02:45,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-01 10:02:45,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-01 10:02:45,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-01 10:02:45,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-01 10:02:45,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-01 10:02:45,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-01 10:02:45,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-01 10:02:45,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-01 10:02:45,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-01 10:02:45,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-01 10:02:45,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-01 10:02:45,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-01 10:02:45,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-01 10:02:45,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-01 10:02:45,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-01 10:02:45,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-01 10:02:45,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-01 10:02:45,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-01 10:02:45,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-01 10:02:45,339 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-01 10:02:45,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-01 10:02:45,341 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-01 10:02:45,369 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-01 10:02:45,369 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-01 10:02:45,370 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-01 10:02:45,370 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-01 10:02:45,372 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-01 10:02:45,372 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-01 10:02:45,372 INFO L138 SettingsManager]: * Use SBE=true [2021-11-01 10:02:45,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-01 10:02:45,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-01 10:02:45,373 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-01 10:02:45,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-01 10:02:45,373 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-01 10:02:45,374 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-01 10:02:45,374 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-01 10:02:45,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-01 10:02:45,374 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-01 10:02:45,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-01 10:02:45,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-01 10:02:45,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-01 10:02:45,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-01 10:02:45,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-01 10:02:45,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-01 10:02:45,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-01 10:02:45,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-01 10:02:45,385 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-01 10:02:45,385 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-01 10:02:45,385 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-01 10:02:45,385 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-01 10:02:45,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-01 10:02:45,386 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-01 10:02:45,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-01 10:02:45,386 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-01 10:02:45,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-01 10:02:45,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-01 10:02:45,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-01 10:02:45,674 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-01 10:02:45,675 INFO L275 PluginConnector]: CDTParser initialized [2021-11-01 10:02:45,676 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-01 10:02:45,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9f12ee71/7a99e6d4b85f4f6e8335b56a952f922f/FLAG773fa8c83 [2021-11-01 10:02:46,323 INFO L306 CDTParser]: Found 1 translation units. [2021-11-01 10:02:46,324 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2021-11-01 10:02:46,356 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9f12ee71/7a99e6d4b85f4f6e8335b56a952f922f/FLAG773fa8c83 [2021-11-01 10:02:46,496 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9f12ee71/7a99e6d4b85f4f6e8335b56a952f922f [2021-11-01 10:02:46,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-01 10:02:46,500 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-01 10:02:46,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-01 10:02:46,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-01 10:02:46,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-01 10:02:46,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 10:02:46" (1/1) ... [2021-11-01 10:02:46,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@778e4f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:46, skipping insertion in model container [2021-11-01 10:02:46,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 10:02:46" (1/1) ... [2021-11-01 10:02:46,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-01 10:02:46,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-01 10:02:46,831 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-01 10:02:46,836 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-01 10:02:46,849 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-01 10:02:46,852 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-01 10:02:47,287 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,288 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,288 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,289 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,289 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,298 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,299 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,300 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,301 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,518 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-01 10:02:47,519 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-01 10:02:47,519 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-01 10:02:47,520 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-01 10:02:47,521 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-01 10:02:47,521 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-01 10:02:47,522 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-01 10:02:47,522 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-01 10:02:47,522 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-01 10:02:47,523 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-01 10:02:47,635 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-01 10:02:47,702 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,702 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-01 10:02:47,809 INFO L203 MainTranslator]: Completed pre-run [2021-11-01 10:02:47,827 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-01 10:02:47,828 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-01 10:02:47,830 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-01 10:02:47,831 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-01 10:02:47,866 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,866 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,867 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,867 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,868 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,876 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,876 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,877 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,877 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,927 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-01 10:02:47,928 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-01 10:02:47,928 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-01 10:02:47,928 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-01 10:02:47,929 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-01 10:02:47,929 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-01 10:02:47,930 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-01 10:02:47,930 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-01 10:02:47,930 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-01 10:02:47,930 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-01 10:02:47,953 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-01 10:02:47,999 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:47,999 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:02:48,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-01 10:02:48,285 INFO L208 MainTranslator]: Completed translation [2021-11-01 10:02:48,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:48 WrapperNode [2021-11-01 10:02:48,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-01 10:02:48,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-01 10:02:48,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-01 10:02:48,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-01 10:02:48,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:48" (1/1) ... [2021-11-01 10:02:48,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:48" (1/1) ... [2021-11-01 10:02:48,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-01 10:02:48,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-01 10:02:48,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-01 10:02:48,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-01 10:02:48,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:48" (1/1) ... [2021-11-01 10:02:48,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:48" (1/1) ... [2021-11-01 10:02:48,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:48" (1/1) ... [2021-11-01 10:02:48,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:48" (1/1) ... [2021-11-01 10:02:48,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:48" (1/1) ... [2021-11-01 10:02:48,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:48" (1/1) ... [2021-11-01 10:02:48,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:48" (1/1) ... [2021-11-01 10:02:48,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-01 10:02:48,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-01 10:02:48,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-01 10:02:48,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-01 10:02:48,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:48" (1/1) ... [2021-11-01 10:02:48,571 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-01 10:02:48,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 10:02:48,603 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-01 10:02:48,629 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-01 10:02:48,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-01 10:02:48,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-01 10:02:48,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-01 10:02:48,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-01 10:02:48,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-01 10:02:48,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-01 10:02:48,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-01 10:02:48,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-01 10:02:48,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-01 10:02:48,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-01 10:02:48,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-01 10:02:48,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-01 10:02:48,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-01 10:02:48,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-01 10:02:54,412 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-01 10:02:54,412 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2021-11-01 10:02:54,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 10:02:54 BoogieIcfgContainer [2021-11-01 10:02:54,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-01 10:02:54,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-01 10:02:54,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-01 10:02:54,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-01 10:02:54,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 10:02:46" (1/3) ... [2021-11-01 10:02:54,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fdbdb26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 10:02:54, skipping insertion in model container [2021-11-01 10:02:54,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:02:48" (2/3) ... [2021-11-01 10:02:54,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fdbdb26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 10:02:54, skipping insertion in model container [2021-11-01 10:02:54,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 10:02:54" (3/3) ... [2021-11-01 10:02:54,424 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_array_harness.i [2021-11-01 10:02:54,431 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-01 10:02:54,431 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-01 10:02:54,469 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-01 10:02:54,472 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-01 10:02:54,473 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-01 10:02:54,482 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-01 10:02:54,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-01 10:02:54,485 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:02:54,485 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:02:54,486 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-01 10:02:54,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:02:54,490 INFO L85 PathProgramCache]: Analyzing trace with hash -86834800, now seen corresponding path program 1 times [2021-11-01 10:02:54,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-01 10:02:54,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832939011] [2021-11-01 10:02:54,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:02:54,505 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-01 10:02:54,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-01 10:02:54,507 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-01 10:02:54,508 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-01 10:02:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:02:56,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-01 10:02:56,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:02:56,821 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-01 10:02:56,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-01 10:02:56,865 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-01 10:02:56,866 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-01 10:02:56,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832939011] [2021-11-01 10:02:56,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832939011] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-01 10:02:56,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:02:56,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-01 10:02:56,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133775631] [2021-11-01 10:02:56,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-01 10:02:56,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-01 10:02:56,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-01 10:02:56,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-01 10:02:56,888 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-01 10:02:59,147 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-01 10:02:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:02:59,487 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2021-11-01 10:02:59,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-01 10:02:59,489 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-01 10:02:59,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:02:59,494 INFO L225 Difference]: With dead ends: 117 [2021-11-01 10:02:59,494 INFO L226 Difference]: Without dead ends: 53 [2021-11-01 10:02:59,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.08ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-01 10:02:59,498 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2480.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.13ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2571.20ms IncrementalHoareTripleChecker+Time [2021-11-01 10:02:59,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 71 Unknown, 0 Unchecked, 1.13ms Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 1 Unknown, 0 Unchecked, 2571.20ms Time] [2021-11-01 10:02:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-01 10:02:59,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-11-01 10:02:59,518 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-01 10:02:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2021-11-01 10:02:59,519 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 12 [2021-11-01 10:02:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:02:59,520 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2021-11-01 10:02:59,520 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-01 10:02:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2021-11-01 10:02:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-01 10:02:59,521 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:02:59,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:02:59,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-01 10:02:59,744 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-01 10:02:59,745 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-01 10:02:59,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:02:59,745 INFO L85 PathProgramCache]: Analyzing trace with hash -479861810, now seen corresponding path program 1 times [2021-11-01 10:02:59,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-01 10:02:59,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564561233] [2021-11-01 10:02:59,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:02:59,749 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-01 10:02:59,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-01 10:02:59,752 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-01 10:02:59,754 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-01 10:03:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:03:01,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-01 10:03:01,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:03:01,910 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-01 10:03:01,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-01 10:03:01,955 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-01 10:03:01,955 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-01 10:03:01,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564561233] [2021-11-01 10:03:01,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564561233] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-01 10:03:01,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:03:01,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-01 10:03:01,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599778977] [2021-11-01 10:03:01,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 10:03:01,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-01 10:03:01,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 10:03:01,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 10:03:01,959 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-01 10:03:04,152 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-01 10:03:04,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:03:04,572 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2021-11-01 10:03:04,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 10:03:04,575 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-01 10:03:04,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:03:04,576 INFO L225 Difference]: With dead ends: 90 [2021-11-01 10:03:04,576 INFO L226 Difference]: Without dead ends: 53 [2021-11-01 10:03:04,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.49ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 10:03:04,577 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2481.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.97ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2593.24ms IncrementalHoareTripleChecker+Time [2021-11-01 10:03:04,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 97 Unknown, 0 Unchecked, 1.97ms Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 1 Unknown, 0 Unchecked, 2593.24ms Time] [2021-11-01 10:03:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-01 10:03:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-11-01 10:03:04,584 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-01 10:03:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2021-11-01 10:03:04,585 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 12 [2021-11-01 10:03:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:03:04,585 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2021-11-01 10:03:04,586 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-01 10:03:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2021-11-01 10:03:04,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-01 10:03:04,586 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:03:04,586 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:03:04,628 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-01 10:03:04,795 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-01 10:03:04,796 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-01 10:03:04,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:03:04,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1018024457, now seen corresponding path program 1 times [2021-11-01 10:03:04,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-01 10:03:04,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273321412] [2021-11-01 10:03:04,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:03:04,800 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-01 10:03:04,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-01 10:03:04,801 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-01 10:03:04,801 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-01 10:03:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:03:06,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 1557 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-01 10:03:06,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:03:07,024 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-01 10:03:07,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-01 10:03:07,128 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-01 10:03:07,129 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-01 10:03:07,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273321412] [2021-11-01 10:03:07,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273321412] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-01 10:03:07,129 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:03:07,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2021-11-01 10:03:07,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446047026] [2021-11-01 10:03:07,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-01 10:03:07,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-01 10:03:07,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-01 10:03:07,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-01 10:03:07,131 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-01 10:03:09,363 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-01 10:03:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:03:10,656 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2021-11-01 10:03:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-01 10:03:10,657 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-01 10:03:10,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:03:10,658 INFO L225 Difference]: With dead ends: 97 [2021-11-01 10:03:10,658 INFO L226 Difference]: Without dead ends: 93 [2021-11-01 10:03:10,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 279.62ms TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-11-01 10:03:10,659 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3167.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.68ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3308.05ms IncrementalHoareTripleChecker+Time [2021-11-01 10:03:10,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 415 Unknown, 0 Unchecked, 9.68ms Time], IncrementalHoareTripleChecker [27 Valid, 387 Invalid, 1 Unknown, 0 Unchecked, 3308.05ms Time] [2021-11-01 10:03:10,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-01 10:03:10,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 61. [2021-11-01 10:03:10,665 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-01 10:03:10,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2021-11-01 10:03:10,666 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 14 [2021-11-01 10:03:10,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:03:10,666 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2021-11-01 10:03:10,667 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-01 10:03:10,667 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2021-11-01 10:03:10,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-01 10:03:10,668 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:03:10,668 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-01 10:03:10,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-01 10:03:10,891 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-01 10:03:10,891 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-01 10:03:10,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:03:10,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1084310207, now seen corresponding path program 1 times [2021-11-01 10:03:10,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-01 10:03:10,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583144719] [2021-11-01 10:03:10,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:03:10,895 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-01 10:03:10,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-01 10:03:10,899 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-01 10:03:10,901 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-01 10:03:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:03:19,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 1566 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-01 10:03:19,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:03:19,700 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-01 10:03:19,853 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-01 10:03:19,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-01 10:03:19,959 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-01 10:03:19,960 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-01 10:03:19,966 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-01 10:03:19,986 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-01 10:03:19,987 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-01 10:03:19,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583144719] [2021-11-01 10:03:19,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583144719] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-01 10:03:19,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:03:19,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2021-11-01 10:03:19,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87876885] [2021-11-01 10:03:19,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-01 10:03:19,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-01 10:03:19,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-01 10:03:19,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-01 10:03:19,989 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-01 10:03:22,185 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-01 10:03:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:03:23,320 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2021-11-01 10:03:23,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-01 10:03:23,320 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-01 10:03:23,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:03:23,321 INFO L225 Difference]: With dead ends: 111 [2021-11-01 10:03:23,321 INFO L226 Difference]: Without dead ends: 68 [2021-11-01 10:03:23,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 397.29ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-01 10:03:23,322 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2932.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.65ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3050.96ms IncrementalHoareTripleChecker+Time [2021-11-01 10:03:23,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 270 Unknown, 0 Unchecked, 5.65ms Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 1 Unknown, 0 Unchecked, 3050.96ms Time] [2021-11-01 10:03:23,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-01 10:03:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2021-11-01 10:03:23,325 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-01 10:03:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2021-11-01 10:03:23,326 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 18 [2021-11-01 10:03:23,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:03:23,326 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2021-11-01 10:03:23,326 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-01 10:03:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2021-11-01 10:03:23,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-01 10:03:23,327 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:03:23,327 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-01 10:03:23,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-11-01 10:03:23,528 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-01 10:03:23,528 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-01 10:03:23,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:03:23,529 INFO L85 PathProgramCache]: Analyzing trace with hash -404251837, now seen corresponding path program 1 times [2021-11-01 10:03:23,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-01 10:03:23,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644511274] [2021-11-01 10:03:23,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:03:23,532 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-01 10:03:23,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-01 10:03:23,533 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-01 10:03:23,534 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-01 10:03:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:03:25,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-01 10:03:25,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:03:25,812 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-01 10:03:26,468 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-01 10:03:26,468 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-01 10:03:26,559 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-01 10:03:26,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-01 10:03:26,798 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-01 10:03:27,099 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-01 10:03:27,099 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-01 10:03:27,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644511274] [2021-11-01 10:03:27,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644511274] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-01 10:03:27,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:03:27,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2021-11-01 10:03:27,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068812067] [2021-11-01 10:03:27,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-01 10:03:27,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-01 10:03:27,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-01 10:03:27,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-01 10:03:27,102 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-01 10:03:29,307 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-01 10:03:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:03:31,400 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2021-11-01 10:03:31,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-01 10:03:31,401 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-01 10:03:31,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:03:31,401 INFO L225 Difference]: With dead ends: 108 [2021-11-01 10:03:31,401 INFO L226 Difference]: Without dead ends: 61 [2021-11-01 10:03:31,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1355.55ms TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-11-01 10:03:31,402 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3721.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.36ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 3902.50ms IncrementalHoareTripleChecker+Time [2021-11-01 10:03:31,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 489 Unknown, 0 Unchecked, 6.36ms Time], IncrementalHoareTripleChecker [2 Valid, 483 Invalid, 1 Unknown, 3 Unchecked, 3902.50ms Time] [2021-11-01 10:03:31,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-01 10:03:31,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-11-01 10:03:31,405 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-01 10:03:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2021-11-01 10:03:31,406 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 18 [2021-11-01 10:03:31,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:03:31,406 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2021-11-01 10:03:31,406 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-01 10:03:31,406 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2021-11-01 10:03:31,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-01 10:03:31,407 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:03:31,409 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-01 10:03:31,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-01 10:03:31,631 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-01 10:03:31,631 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-01 10:03:31,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:03:31,632 INFO L85 PathProgramCache]: Analyzing trace with hash 501656654, now seen corresponding path program 1 times [2021-11-01 10:03:31,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-01 10:03:31,635 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634549075] [2021-11-01 10:03:31,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:03:31,635 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-01 10:03:31,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-01 10:03:31,636 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-01 10:03:31,638 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-01 10:03:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:03:33,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 1576 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-01 10:03:33,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:03:33,905 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-01 10:03:33,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-01 10:03:33,999 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-01 10:03:33,999 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-01 10:03:33,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634549075] [2021-11-01 10:03:33,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634549075] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-01 10:03:33,999 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:03:33,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-01 10:03:33,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070436077] [2021-11-01 10:03:34,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 10:03:34,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-01 10:03:34,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 10:03:34,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 10:03:34,004 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-01 10:03:36,210 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-01 10:03:36,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:03:36,688 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2021-11-01 10:03:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 10:03:36,689 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-01 10:03:36,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:03:36,689 INFO L225 Difference]: With dead ends: 82 [2021-11-01 10:03:36,689 INFO L226 Difference]: Without dead ends: 61 [2021-11-01 10:03:36,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.43ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-01 10:03:36,690 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2529.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.85ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2636.71ms IncrementalHoareTripleChecker+Time [2021-11-01 10:03:36,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 95 Unknown, 0 Unchecked, 1.85ms Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 1 Unknown, 0 Unchecked, 2636.71ms Time] [2021-11-01 10:03:36,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-01 10:03:36,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-11-01 10:03:36,694 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-01 10:03:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2021-11-01 10:03:36,695 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 20 [2021-11-01 10:03:36,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:03:36,695 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2021-11-01 10:03:36,695 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-01 10:03:36,695 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2021-11-01 10:03:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-01 10:03:36,696 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:03:36,696 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-01 10:03:36,735 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-01 10:03:36,923 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-01 10:03:36,924 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-01 10:03:36,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:03:36,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1522937572, now seen corresponding path program 1 times [2021-11-01 10:03:36,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-01 10:03:36,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088444580] [2021-11-01 10:03:36,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:03:36,927 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-01 10:03:36,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-01 10:03:36,928 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-01 10:03:36,929 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-01 10:03:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:03:39,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 1570 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-01 10:03:39,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:03:39,288 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-01 10:03:39,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-01 10:03:39,423 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-01 10:03:39,423 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-01 10:03:39,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088444580] [2021-11-01 10:03:39,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088444580] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-01 10:03:39,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:03:39,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2021-11-01 10:03:39,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060883265] [2021-11-01 10:03:39,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-01 10:03:39,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-01 10:03:39,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-01 10:03:39,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-01 10:03:39,425 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-01 10:03:41,621 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-01 10:03:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:03:42,807 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2021-11-01 10:03:42,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-01 10:03:42,808 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-01 10:03:42,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:03:42,809 INFO L225 Difference]: With dead ends: 123 [2021-11-01 10:03:42,809 INFO L226 Difference]: Without dead ends: 79 [2021-11-01 10:03:42,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 323.37ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-01 10:03:42,810 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3060.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.00ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3201.32ms IncrementalHoareTripleChecker+Time [2021-11-01 10:03:42,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 264 Unknown, 0 Unchecked, 4.00ms Time], IncrementalHoareTripleChecker [9 Valid, 254 Invalid, 1 Unknown, 0 Unchecked, 3201.32ms Time] [2021-11-01 10:03:42,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-11-01 10:03:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2021-11-01 10:03:42,823 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-01 10:03:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2021-11-01 10:03:42,824 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 20 [2021-11-01 10:03:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:03:42,824 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2021-11-01 10:03:42,824 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-01 10:03:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2021-11-01 10:03:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-01 10:03:42,824 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:03:42,824 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-01 10:03:42,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-01 10:03:43,025 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-01 10:03:43,025 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-01 10:03:43,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:03:43,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1962683098, now seen corresponding path program 1 times [2021-11-01 10:03:43,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-01 10:03:43,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176178086] [2021-11-01 10:03:43,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:03:43,030 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-01 10:03:43,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-01 10:03:43,031 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-01 10:03:43,032 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-01 10:03:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:03:45,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 1573 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-01 10:03:45,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:03:45,528 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-01 10:03:45,535 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-01 10:03:45,918 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-01 10:03:45,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-01 10:03:46,394 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-01 10:03:46,395 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-01 10:03:46,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176178086] [2021-11-01 10:03:46,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176178086] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-01 10:03:46,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:03:46,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 15 [2021-11-01 10:03:46,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631213874] [2021-11-01 10:03:46,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-01 10:03:46,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-01 10:03:46,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-01 10:03:46,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-11-01 10:03:46,396 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-01 10:03:48,601 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-01 10:03:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:03:54,750 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2021-11-01 10:03:54,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-01 10:03:54,751 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-01 10:03:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:03:54,751 INFO L225 Difference]: With dead ends: 112 [2021-11-01 10:03:54,751 INFO L226 Difference]: Without dead ends: 108 [2021-11-01 10:03:54,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 4338.45ms TimeCoverageRelationStatistics Valid=335, Invalid=1225, Unknown=0, NotChecked=0, Total=1560 [2021-11-01 10:03:54,753 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 169 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 74 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4558.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.35ms SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4821.36ms IncrementalHoareTripleChecker+Time [2021-11-01 10:03:54,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 0 Invalid, 808 Unknown, 0 Unchecked, 11.35ms Time], IncrementalHoareTripleChecker [74 Valid, 733 Invalid, 1 Unknown, 0 Unchecked, 4821.36ms Time] [2021-11-01 10:03:54,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-01 10:03:54,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 56. [2021-11-01 10:03:54,756 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-01 10:03:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-11-01 10:03:54,759 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 20 [2021-11-01 10:03:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:03:54,759 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-11-01 10:03:54,759 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-01 10:03:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-11-01 10:03:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-01 10:03:54,760 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:03:54,760 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-01 10:03:54,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-01 10:03:54,975 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-01 10:03:54,976 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-01 10:03:54,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:03:54,976 INFO L85 PathProgramCache]: Analyzing trace with hash -863865621, now seen corresponding path program 1 times [2021-11-01 10:03:54,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-01 10:03:54,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368810758] [2021-11-01 10:03:54,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:03:54,979 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-01 10:03:54,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-01 10:03:54,980 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-01 10:03:54,981 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-01 10:04:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:04:07,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 1584 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-01 10:04:07,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:04:07,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-01 10:04:07,430 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-01 10:04:08,574 INFO L354 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2021-11-01 10:04:08,575 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-01 10:04:08,647 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-01 10:04:08,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-01 10:04:09,758 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-01 10:04:09,759 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-01 10:04:14,113 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-01 10:04:14,114 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-01 10:04:14,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368810758] [2021-11-01 10:04:14,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368810758] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-01 10:04:14,114 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:04:14,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 9] imperfect sequences [] total 18 [2021-11-01 10:04:14,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23910646] [2021-11-01 10:04:14,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-01 10:04:14,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-01 10:04:14,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-01 10:04:14,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-11-01 10:04:14,115 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-01 10:04:16,321 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-01 10:04:18,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:04:18,289 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2021-11-01 10:04:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-01 10:04:18,290 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-01 10:04:18,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:04:18,290 INFO L225 Difference]: With dead ends: 74 [2021-11-01 10:04:18,290 INFO L226 Difference]: Without dead ends: 72 [2021-11-01 10:04:18,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 2541.31ms TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2021-11-01 10:04:18,291 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2887.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.02ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 3009.10ms IncrementalHoareTripleChecker+Time [2021-11-01 10:04:18,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 334 Unknown, 0 Unchecked, 4.02ms Time], IncrementalHoareTripleChecker [6 Valid, 209 Invalid, 1 Unknown, 118 Unchecked, 3009.10ms Time] [2021-11-01 10:04:18,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-01 10:04:18,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2021-11-01 10:04:18,295 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-01 10:04:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2021-11-01 10:04:18,295 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 24 [2021-11-01 10:04:18,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:04:18,295 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2021-11-01 10:04:18,296 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-01 10:04:18,296 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2021-11-01 10:04:18,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-01 10:04:18,296 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:04:18,296 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-01 10:04:18,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-11-01 10:04:18,503 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-01 10:04:18,503 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-01 10:04:18,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:04:18,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1075136575, now seen corresponding path program 1 times [2021-11-01 10:04:18,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-01 10:04:18,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442391876] [2021-11-01 10:04:18,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:04:18,507 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-01 10:04:18,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-01 10:04:18,508 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-01 10:04:18,509 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-01 10:04:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:04:20,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 1589 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-01 10:04:20,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:04:20,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-01 10:04:20,963 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-01 10:04:22,101 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-01 10:04:22,101 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-01 10:04:22,233 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-01 10:04:22,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-01 10:04:23,432 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-01 10:04:23,432 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-01 10:04:23,441 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-01 10:04:23,441 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-01 10:04:23,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442391876] [2021-11-01 10:04:23,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442391876] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-01 10:04:23,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:04:23,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 8] imperfect sequences [] total 16 [2021-11-01 10:04:23,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137981411] [2021-11-01 10:04:23,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-01 10:04:23,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-01 10:04:23,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-01 10:04:23,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-11-01 10:04:23,442 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-01 10:04:25,653 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-01 10:04:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:04:27,059 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2021-11-01 10:04:27,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-01 10:04:27,059 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-01 10:04:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:04:27,060 INFO L225 Difference]: With dead ends: 105 [2021-11-01 10:04:27,060 INFO L226 Difference]: Without dead ends: 72 [2021-11-01 10:04:27,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2262.18ms TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2021-11-01 10:04:27,060 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3017.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.87ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 3149.12ms IncrementalHoareTripleChecker+Time [2021-11-01 10:04:27,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 444 Unknown, 0 Unchecked, 3.87ms Time], IncrementalHoareTripleChecker [2 Valid, 228 Invalid, 1 Unknown, 213 Unchecked, 3149.12ms Time] [2021-11-01 10:04:27,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-01 10:04:27,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2021-11-01 10:04:27,066 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-01 10:04:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2021-11-01 10:04:27,068 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 26 [2021-11-01 10:04:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:04:27,068 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2021-11-01 10:04:27,069 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-01 10:04:27,069 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2021-11-01 10:04:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-01 10:04:27,071 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:04:27,071 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-01 10:04:27,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-01 10:04:27,275 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-01 10:04:27,275 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-01 10:04:27,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:04:27,276 INFO L85 PathProgramCache]: Analyzing trace with hash 27288689, now seen corresponding path program 1 times [2021-11-01 10:04:27,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-01 10:04:27,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618060121] [2021-11-01 10:04:27,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:04:27,280 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-01 10:04:27,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-01 10:04:27,281 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-01 10:04:27,283 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-01 10:04:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:04:29,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 1603 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-01 10:04:29,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:04:29,792 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-01 10:04:29,810 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-01 10:04:29,880 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-01 10:04:29,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-01 10:04:30,252 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-01 10:04:30,252 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-01 10:04:30,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618060121] [2021-11-01 10:04:30,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618060121] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-01 10:04:30,253 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:04:30,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2021-11-01 10:04:30,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81262283] [2021-11-01 10:04:30,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-01 10:04:30,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-01 10:04:30,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-01 10:04:30,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-01 10:04:30,254 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-01 10:04:32,462 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-01 10:04:34,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:04:34,183 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2021-11-01 10:04:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-01 10:04:34,184 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-01 10:04:34,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:04:34,185 INFO L225 Difference]: With dead ends: 70 [2021-11-01 10:04:34,185 INFO L226 Difference]: Without dead ends: 68 [2021-11-01 10:04:34,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 845.30ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-11-01 10:04:34,186 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3128.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.43ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3302.56ms IncrementalHoareTripleChecker+Time [2021-11-01 10:04:34,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 228 Unknown, 0 Unchecked, 4.43ms Time], IncrementalHoareTripleChecker [6 Valid, 221 Invalid, 1 Unknown, 0 Unchecked, 3302.56ms Time] [2021-11-01 10:04:34,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-01 10:04:34,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-11-01 10:04:34,189 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-01 10:04:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-11-01 10:04:34,190 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 27 [2021-11-01 10:04:34,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:04:34,190 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-11-01 10:04:34,190 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-01 10:04:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-11-01 10:04:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-01 10:04:34,191 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:04:34,191 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-01 10:04:34,236 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-01 10:04:34,399 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-01 10:04:34,400 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-01 10:04:34,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:04:34,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1485259652, now seen corresponding path program 1 times [2021-11-01 10:04:34,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-01 10:04:34,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716584942] [2021-11-01 10:04:34,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:04:34,404 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-01 10:04:34,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-01 10:04:34,405 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-01 10:04:34,407 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-01 10:04:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:04:36,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 1600 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-01 10:04:36,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:04:37,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-01 10:04:37,129 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-01 10:04:38,922 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-11-01 10:04:38,922 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-01 10:04:39,047 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-01 10:04:39,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-01 10:04:40,251 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-01 10:04:40,253 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-01 10:04:40,262 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-01 10:04:40,262 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-01 10:04:40,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716584942] [2021-11-01 10:04:40,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716584942] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-01 10:04:40,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:04:40,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 8] imperfect sequences [] total 16 [2021-11-01 10:04:40,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957912143] [2021-11-01 10:04:40,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-01 10:04:40,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-01 10:04:40,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-01 10:04:40,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-11-01 10:04:40,264 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-01 10:04:42,472 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-01 10:04:43,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:04:43,927 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2021-11-01 10:04:43,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-01 10:04:43,928 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-01 10:04:43,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:04:43,928 INFO L225 Difference]: With dead ends: 86 [2021-11-01 10:04:43,928 INFO L226 Difference]: Without dead ends: 68 [2021-11-01 10:04:43,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2363.31ms TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-11-01 10:04:43,929 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2918.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.77ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 3033.69ms IncrementalHoareTripleChecker+Time [2021-11-01 10:04:43,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 412 Unknown, 0 Unchecked, 2.77ms Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 1 Unknown, 175 Unchecked, 3033.69ms Time] [2021-11-01 10:04:43,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-01 10:04:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-11-01 10:04:43,932 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-01 10:04:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2021-11-01 10:04:43,932 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 30 [2021-11-01 10:04:43,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:04:43,933 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2021-11-01 10:04:43,933 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-01 10:04:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2021-11-01 10:04:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-01 10:04:43,933 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:04:43,933 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-01 10:04:43,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-01 10:04:44,144 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-01 10:04:44,144 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-01 10:04:44,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:04:44,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1328145208, now seen corresponding path program 1 times [2021-11-01 10:04:44,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-01 10:04:44,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622412633] [2021-11-01 10:04:44,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:04:44,148 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-01 10:04:44,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-01 10:04:44,149 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-01 10:04:44,150 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-01 10:04:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:04:46,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 1615 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-01 10:04:46,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:04:46,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-01 10:04:46,476 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-01 10:04:49,378 INFO L354 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2021-11-01 10:04:49,380 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-01 10:04:49,548 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-01 10:04:49,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-01 10:04:50,954 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-01 10:04:50,955 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-01 10:04:50,963 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-01 10:04:50,963 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-01 10:04:50,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622412633] [2021-11-01 10:04:50,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622412633] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-01 10:04:50,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:04:50,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 8] imperfect sequences [] total 17 [2021-11-01 10:04:50,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859378198] [2021-11-01 10:04:50,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-01 10:04:50,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-01 10:04:50,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-01 10:04:50,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-11-01 10:04:50,964 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-01 10:04:53,166 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-01 10:04:54,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:04:54,324 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2021-11-01 10:04:54,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-01 10:04:54,324 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-01 10:04:54,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:04:54,325 INFO L225 Difference]: With dead ends: 78 [2021-11-01 10:04:54,325 INFO L226 Difference]: Without dead ends: 54 [2021-11-01 10:04:54,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 4018.48ms TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2021-11-01 10:04:54,326 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2826.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.83ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 2945.89ms IncrementalHoareTripleChecker+Time [2021-11-01 10:04:54,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 460 Unknown, 0 Unchecked, 2.83ms Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 1 Unknown, 253 Unchecked, 2945.89ms Time] [2021-11-01 10:04:54,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-11-01 10:04:54,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-11-01 10:04:54,328 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-01 10:04:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2021-11-01 10:04:54,328 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 32 [2021-11-01 10:04:54,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:04:54,328 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2021-11-01 10:04:54,328 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-01 10:04:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2021-11-01 10:04:54,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-01 10:04:54,329 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:04:54,329 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-01 10:04:54,364 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-01 10:04:54,543 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-01 10:04:54,543 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-01 10:04:54,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:04:54,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1234346222, now seen corresponding path program 1 times [2021-11-01 10:04:54,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-01 10:04:54,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141682247] [2021-11-01 10:04:54,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:04:54,547 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-01 10:04:54,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-01 10:04:54,549 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-01 10:04:54,549 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-01 10:04:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:04:56,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 1605 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-01 10:04:56,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:04:58,223 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-01 10:04:58,224 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-01 10:04:58,232 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-01 10:04:58,232 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-01 10:04:58,346 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-01 10:04:58,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-01 10:05:05,679 WARN L210 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2021-11-01 10:05:05,680 INFO L354 Elim1Store]: treesize reduction 27, result has 41.3 percent of original size [2021-11-01 10:05:05,680 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-01 10:05:05,746 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-11-01 10:05:05,746 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-01 10:05:05,931 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-01 10:05:05,931 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-01 10:05:05,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141682247] [2021-11-01 10:05:05,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141682247] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-01 10:05:05,931 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:05:05,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 17 [2021-11-01 10:05:05,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078142536] [2021-11-01 10:05:05,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-01 10:05:05,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-01 10:05:05,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-01 10:05:05,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-11-01 10:05:05,933 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-01 10:05:08,144 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-01 10:05:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:05:10,354 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2021-11-01 10:05:10,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-01 10:05:10,355 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-01 10:05:10,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:05:10,355 INFO L225 Difference]: With dead ends: 82 [2021-11-01 10:05:10,355 INFO L226 Difference]: Without dead ends: 61 [2021-11-01 10:05:10,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2546.18ms TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2021-11-01 10:05:10,359 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3041.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.13ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 3174.21ms IncrementalHoareTripleChecker+Time [2021-11-01 10:05:10,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 359 Unknown, 0 Unchecked, 3.13ms Time], IncrementalHoareTripleChecker [6 Valid, 257 Invalid, 1 Unknown, 95 Unchecked, 3174.21ms Time] [2021-11-01 10:05:10,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-01 10:05:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2021-11-01 10:05:10,362 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-01 10:05:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2021-11-01 10:05:10,362 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 32 [2021-11-01 10:05:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:05:10,362 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2021-11-01 10:05:10,362 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-01 10:05:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2021-11-01 10:05:10,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-01 10:05:10,363 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:05:10,363 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-01 10:05:10,398 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-01 10:05:10,563 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-01 10:05:10,565 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-01 10:05:10,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:05:10,566 INFO L85 PathProgramCache]: Analyzing trace with hash -554287852, now seen corresponding path program 1 times [2021-11-01 10:05:10,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-01 10:05:10,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233702496] [2021-11-01 10:05:10,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:05:10,569 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-01 10:05:10,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-01 10:05:10,570 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-01 10:05:10,571 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-01 10:05:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:05:12,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 1602 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-01 10:05:12,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:05:12,862 INFO L354 Elim1Store]: treesize reduction 22, result has 26.7 percent of original size [2021-11-01 10:05:12,863 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-01 10:05:16,501 INFO L354 Elim1Store]: treesize reduction 24, result has 61.9 percent of original size [2021-11-01 10:05:16,501 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-01 10:05:16,687 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-01 10:05:16,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-01 10:05:17,673 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-01 10:05:17,674 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-01 10:05:17,906 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-01 10:05:18,063 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-01 10:05:18,063 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-01 10:05:43,616 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-01 10:05:43,617 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-01 10:05:43,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233702496] [2021-11-01 10:05:43,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233702496] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-01 10:05:43,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:05:43,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 17 [2021-11-01 10:05:43,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059240122] [2021-11-01 10:05:43,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-01 10:05:43,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-01 10:05:43,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-01 10:05:43,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-11-01 10:05:43,618 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-01 10:05:45,817 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-01 10:05:46,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:05:46,922 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2021-11-01 10:05:46,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-01 10:05:46,923 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-01 10:05:46,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:05:46,923 INFO L225 Difference]: With dead ends: 77 [2021-11-01 10:05:46,923 INFO L226 Difference]: Without dead ends: 47 [2021-11-01 10:05:46,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 3976.35ms TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-11-01 10:05:46,924 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2836.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.42ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 2953.07ms IncrementalHoareTripleChecker+Time [2021-11-01 10:05:46,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 0 Invalid, 317 Unknown, 0 Unchecked, 1.42ms Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 1 Unknown, 102 Unchecked, 2953.07ms Time] [2021-11-01 10:05:46,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-11-01 10:05:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-11-01 10:05:46,926 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-01 10:05:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 46 transitions. [2021-11-01 10:05:46,927 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 46 transitions. Word has length 32 [2021-11-01 10:05:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:05:46,927 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 46 transitions. [2021-11-01 10:05:46,927 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-01 10:05:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 46 transitions. [2021-11-01 10:05:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-01 10:05:46,927 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:05:46,927 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-01 10:05:46,963 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-01 10:05:47,132 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-01 10:05:47,132 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-01 10:05:47,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:05:47,133 INFO L85 PathProgramCache]: Analyzing trace with hash -821254579, now seen corresponding path program 1 times [2021-11-01 10:05:47,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-01 10:05:47,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726610162] [2021-11-01 10:05:47,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:05:47,136 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-01 10:05:47,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-01 10:05:47,137 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-01 10:05:47,138 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-01 10:06:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:06:18,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-01 10:06:18,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:06:18,581 INFO L354 Elim1Store]: treesize reduction 22, result has 26.7 percent of original size [2021-11-01 10:06:18,581 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-01 10:06:19,983 INFO L354 Elim1Store]: treesize reduction 48, result has 37.7 percent of original size [2021-11-01 10:06:19,984 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-01 10:06:20,057 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-01 10:06:20,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-01 10:06:21,203 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-01 10:06:21,203 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-01 10:06:21,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-01 10:06:22,525 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-01 10:06:22,526 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-01 10:06:32,858 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-01 10:06:32,859 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-01 10:06:32,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726610162] [2021-11-01 10:06:32,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726610162] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-01 10:06:32,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:06:32,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [] total 14 [2021-11-01 10:06:32,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289693734] [2021-11-01 10:06:32,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-01 10:06:32,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-01 10:06:32,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-01 10:06:32,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-01 10:06:32,860 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-01 10:06:35,077 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-01 10:06:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:06:36,144 INFO L93 Difference]: Finished difference Result 47 states and 46 transitions. [2021-11-01 10:06:36,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-01 10:06:36,145 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-01 10:06:36,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:06:36,145 INFO L225 Difference]: With dead ends: 47 [2021-11-01 10:06:36,145 INFO L226 Difference]: Without dead ends: 45 [2021-11-01 10:06:36,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1255.77ms TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-11-01 10:06:36,146 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2732.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.56ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 2851.05ms IncrementalHoareTripleChecker+Time [2021-11-01 10:06:36,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 216 Unknown, 0 Unchecked, 1.56ms Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 1 Unknown, 87 Unchecked, 2851.05ms Time] [2021-11-01 10:06:36,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-11-01 10:06:36,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-11-01 10:06:36,148 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-01 10:06:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 44 transitions. [2021-11-01 10:06:36,148 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 44 transitions. Word has length 36 [2021-11-01 10:06:36,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:06:36,148 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 44 transitions. [2021-11-01 10:06:36,149 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-01 10:06:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 44 transitions. [2021-11-01 10:06:36,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-01 10:06:36,149 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:06:36,149 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-01 10:06:36,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-11-01 10:06:36,363 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-01 10:06:36,364 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-01 10:06:36,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:06:36,364 INFO L85 PathProgramCache]: Analyzing trace with hash 52794010, now seen corresponding path program 1 times [2021-11-01 10:06:36,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-01 10:06:36,367 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209680653] [2021-11-01 10:06:36,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:06:36,368 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-01 10:06:36,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-01 10:06:36,368 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-01 10:06:36,369 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-01 10:07:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:07:24,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 1647 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-01 10:07:24,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:07:24,970 INFO L354 Elim1Store]: treesize reduction 85, result has 9.6 percent of original size [2021-11-01 10:07:24,971 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-01 10:07:24,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-01 10:07:24,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-01 10:07:24,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-01 10:07:25,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-01 10:07:26,221 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-01 10:07:26,221 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-01 10:07:26,234 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-01 10:07:26,234 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-01 10:07:26,460 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-01 10:07:26,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-01 10:07:26,582 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-11-01 10:07:26,582 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-01 10:07:27,656 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-01 10:07:27,672 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-01 10:07:27,714 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-01 10:07:27,714 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-01 10:07:27,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209680653] [2021-11-01 10:07:27,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209680653] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-01 10:07:27,714 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:07:27,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2021-11-01 10:07:27,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887417675] [2021-11-01 10:07:27,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-01 10:07:27,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-01 10:07:27,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-01 10:07:27,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-01 10:07:27,715 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-01 10:07:29,930 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-01 10:07:31,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:07:31,468 INFO L93 Difference]: Finished difference Result 45 states and 44 transitions. [2021-11-01 10:07:31,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-01 10:07:31,470 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-01 10:07:31,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:07:31,470 INFO L225 Difference]: With dead ends: 45 [2021-11-01 10:07:31,470 INFO L226 Difference]: Without dead ends: 0 [2021-11-01 10:07:31,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1263.94ms TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-11-01 10:07:31,471 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3035.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.13ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 3178.36ms IncrementalHoareTripleChecker+Time [2021-11-01 10:07:31,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 300 Unknown, 0 Unchecked, 2.13ms Time], IncrementalHoareTripleChecker [7 Valid, 188 Invalid, 1 Unknown, 104 Unchecked, 3178.36ms Time] [2021-11-01 10:07:31,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-01 10:07:31,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-01 10:07:31,472 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-01 10:07:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-01 10:07:31,472 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2021-11-01 10:07:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:07:31,472 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-01 10:07:31,472 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-01 10:07:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-01 10:07:31,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-01 10:07:31,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-11-01 10:07:31,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-11-01 10:07:31,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-11-01 10:07:31,475 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-11-01 10:07:31,475 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-11-01 10:07:31,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-01 10:07:31,697 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-01 10:07:31,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-01 10:07:31,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:07:31,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:07:31,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:07:31,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:07:31,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:07:31,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:07:34,917 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 10:07:34,917 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 10:07:34,917 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-01 10:07:34,918 INFO L858 garLoopResultBuilder]: For program point L7386(lines 7386 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,918 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-01 10:07:34,918 INFO L858 garLoopResultBuilder]: For program point L7386-4(lines 7386 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,918 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-01 10:07:34,918 INFO L858 garLoopResultBuilder]: For program point L7386-2(lines 7386 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,918 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-01 10:07:34,918 INFO L858 garLoopResultBuilder]: For program point L7386-6(lines 7386 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,918 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:07:34,918 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:07:34,918 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:07:34,918 INFO L858 garLoopResultBuilder]: For program point L7387(line 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,919 INFO L858 garLoopResultBuilder]: For program point L7387-5(line 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,919 INFO L858 garLoopResultBuilder]: For program point L7387-4(line 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,919 INFO L858 garLoopResultBuilder]: For program point L7387-2(line 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,919 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 10:07:34,919 INFO L858 garLoopResultBuilder]: For program point L7387-8(line 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,919 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-01 10:07:34,919 INFO L858 garLoopResultBuilder]: For program point L7387-6(line 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,919 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-01 10:07:34,919 INFO L858 garLoopResultBuilder]: For program point L7387-12(line 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,920 INFO L858 garLoopResultBuilder]: For program point L7387-11(line 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,920 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-01 10:07:34,920 INFO L858 garLoopResultBuilder]: For program point L7387-10(line 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,920 INFO L858 garLoopResultBuilder]: For program point L7387-17(line 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,920 INFO L858 garLoopResultBuilder]: For program point L7387-16(line 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,920 INFO L858 garLoopResultBuilder]: For program point L7387-14(line 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,920 INFO L858 garLoopResultBuilder]: For program point L7387-20(line 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,920 INFO L858 garLoopResultBuilder]: For program point L7387-18(line 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,920 INFO L858 garLoopResultBuilder]: For program point L7387-23(line 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,921 INFO L858 garLoopResultBuilder]: For program point L7387-22(line 7387) no Hoare annotation was computed. [2021-11-01 10:07:34,921 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-11-01 10:07:34,921 INFO L861 garLoopResultBuilder]: At program point L8974(line 8974) the Hoare annotation is: true [2021-11-01 10:07:34,921 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-01 10:07:34,921 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-01 10:07:34,921 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-01 10:07:34,921 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-01 10:07:34,922 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-01 10:07:34,922 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-01 10:07:34,922 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 7101 7111) no Hoare annotation was computed. [2021-11-01 10:07:34,922 INFO L858 garLoopResultBuilder]: For program point L8959(lines 8959 8973) no Hoare annotation was computed. [2021-11-01 10:07:34,922 INFO L858 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-01 10:07:34,922 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 10:07:34,922 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-01 10:07:34,922 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-01 10:07:34,922 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-01 10:07:34,923 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-01 10:07:34,923 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-01 10:07:34,923 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-01 10:07:34,923 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-01 10:07:34,923 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-01 10:07:34,923 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-01 10:07:34,923 INFO L858 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-01 10:07:34,923 INFO L858 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-01 10:07:34,923 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 10:07:34,924 INFO L858 garLoopResultBuilder]: For program point L8970(lines 8970 8972) no Hoare annotation was computed. [2021-11-01 10:07:34,924 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-01 10:07:34,924 INFO L858 garLoopResultBuilder]: For program point L8970-2(lines 8970 8972) no Hoare annotation was computed. [2021-11-01 10:07:34,926 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-01 10:07:34,928 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-01 10:07:34,932 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:34,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:34,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,940 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:34,941 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-01 10:07:34,941 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-01 10:07:34,941 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-01 10:07:34,941 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:34,941 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-01 10:07:34,941 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-01 10:07:34,942 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-01 10:07:34,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,942 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-01 10:07:34,942 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-01 10:07:34,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,942 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-01 10:07:34,943 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-01 10:07:34,943 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:34,943 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-01 10:07:34,943 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,943 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-01 10:07:34,943 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,944 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-01 10:07:34,944 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-01 10:07:34,944 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-01 10:07:34,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:34,944 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-01 10:07:34,944 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-01 10:07:34,945 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-01 10:07:34,945 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-01 10:07:34,945 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-01 10:07:34,945 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-01 10:07:34,945 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-01 10:07:34,945 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-01 10:07:34,945 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-01 10:07:34,946 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,946 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-01 10:07:34,946 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-01 10:07:34,946 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-01 10:07:34,946 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-01 10:07:34,946 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-01 10:07:34,946 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-01 10:07:34,947 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-01 10:07:34,947 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-01 10:07:34,947 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-01 10:07:34,947 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,947 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-01 10:07:34,947 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-01 10:07:34,948 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-01 10:07:34,948 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-01 10:07:34,948 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-01 10:07:34,948 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-01 10:07:34,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:34,950 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-01 10:07:34,950 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-01 10:07:34,950 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-01 10:07:34,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:34,950 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-01 10:07:34,951 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-01 10:07:34,951 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-01 10:07:34,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,952 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-01 10:07:34,952 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-01 10:07:34,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,953 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-01 10:07:34,953 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-01 10:07:34,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:34,959 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-01 10:07:34,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,959 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-01 10:07:34,960 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,960 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-01 10:07:34,960 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-01 10:07:34,960 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-01 10:07:34,960 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:34,960 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-01 10:07:34,960 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-01 10:07:34,960 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-01 10:07:34,960 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-01 10:07:34,960 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-01 10:07:34,961 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-01 10:07:34,961 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-01 10:07:34,961 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-01 10:07:34,961 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-01 10:07:34,961 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,961 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-01 10:07:34,961 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-01 10:07:34,961 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-01 10:07:34,961 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-01 10:07:34,962 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-01 10:07:34,962 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-01 10:07:34,962 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-01 10:07:34,962 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-01 10:07:34,962 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-01 10:07:34,962 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,962 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-01 10:07:34,962 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-01 10:07:34,962 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-01 10:07:34,962 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-01 10:07:34,962 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-01 10:07:34,962 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-01 10:07:34,964 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,979 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:34,980 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:34,982 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-01 10:07:34,982 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-01 10:07:34,982 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-01 10:07:34,982 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-01 10:07:34,982 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-01 10:07:34,982 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-01 10:07:34,983 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-01 10:07:34,983 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-01 10:07:34,983 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-01 10:07:34,983 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-01 10:07:34,983 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-01 10:07:34,983 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-01 10:07:34,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:34,983 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-01 10:07:34,983 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-01 10:07:34,984 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-01 10:07:34,984 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-01 10:07:34,984 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-01 10:07:34,984 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-01 10:07:34,984 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-01 10:07:34,984 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-01 10:07:34,985 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-01 10:07:34,985 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-01 10:07:34,985 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-01 10:07:34,985 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-01 10:07:34,985 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-01 10:07:34,985 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-01 10:07:34,985 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-01 10:07:34,986 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-01 10:07:34,986 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-01 10:07:34,986 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-01 10:07:34,986 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-01 10:07:34,986 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-01 10:07:34,986 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:34,986 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:34,986 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-01 10:07:34,986 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-01 10:07:34,986 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-01 10:07:34,986 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-01 10:07:34,987 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-01 10:07:34,987 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-01 10:07:34,987 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-01 10:07:34,987 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-01 10:07:34,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 10:07:34 BoogieIcfgContainer [2021-11-01 10:07:34,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-01 10:07:34,989 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-01 10:07:34,989 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-01 10:07:34,989 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-01 10:07:34,989 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 10:02:54" (3/4) ... [2021-11-01 10:07:35,001 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-01 10:07:35,017 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2021-11-01 10:07:35,018 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2021-11-01 10:07:35,019 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-11-01 10:07:35,019 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-01 10:07:35,020 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-01 10:07:35,021 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-01 10:07:35,021 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-01 10:07:35,022 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-01 10:07:35,041 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv64 == \result) && ~bvule64(length, 36028797018963967bv64)) && 1bv8 == cond [2021-11-01 10:07:35,042 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-01 10:07:35,042 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-01 10:07:35,042 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-01 10:07:35,043 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-01 10:07:35,540 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-01 10:07:35,541 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-01 10:07:35,541 INFO L158 Benchmark]: Toolchain (without parser) took 289041.46ms. Allocated memory was 58.7MB in the beginning and 954.2MB in the end (delta: 895.5MB). Free memory was 27.5MB in the beginning and 835.8MB in the end (delta: -808.3MB). Peak memory consumption was 605.2MB. Max. memory is 16.1GB. [2021-11-01 10:07:35,541 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 58.7MB. Free memory was 40.2MB in the beginning and 40.1MB in the end (delta: 44.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-01 10:07:35,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1784.25ms. Allocated memory was 58.7MB in the beginning and 123.7MB in the end (delta: 65.0MB). Free memory was 27.2MB in the beginning and 63.5MB in the end (delta: -36.2MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2021-11-01 10:07:35,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 172.47ms. Allocated memory is still 123.7MB. Free memory was 63.5MB in the beginning and 51.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-01 10:07:35,542 INFO L158 Benchmark]: Boogie Preprocessor took 104.23ms. Allocated memory is still 123.7MB. Free memory was 51.6MB in the beginning and 69.2MB in the end (delta: -17.6MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2021-11-01 10:07:35,542 INFO L158 Benchmark]: RCFGBuilder took 5848.46ms. Allocated memory was 123.7MB in the beginning and 666.9MB in the end (delta: 543.2MB). Free memory was 69.2MB in the beginning and 306.8MB in the end (delta: -237.7MB). Peak memory consumption was 397.9MB. Max. memory is 16.1GB. [2021-11-01 10:07:35,542 INFO L158 Benchmark]: TraceAbstraction took 280574.07ms. Allocated memory was 666.9MB in the beginning and 954.2MB in the end (delta: 287.3MB). Free memory was 306.8MB in the beginning and 525.4MB in the end (delta: -218.6MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. [2021-11-01 10:07:35,542 INFO L158 Benchmark]: Witness Printer took 552.25ms. Allocated memory is still 954.2MB. Free memory was 525.4MB in the beginning and 835.8MB in the end (delta: -310.4MB). Peak memory consumption was 207.6MB. Max. memory is 16.1GB. [2021-11-01 10:07:35,543 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 58.7MB. Free memory was 40.2MB in the beginning and 40.1MB in the end (delta: 44.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1784.25ms. Allocated memory was 58.7MB in the beginning and 123.7MB in the end (delta: 65.0MB). Free memory was 27.2MB in the beginning and 63.5MB in the end (delta: -36.2MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 172.47ms. Allocated memory is still 123.7MB. Free memory was 63.5MB in the beginning and 51.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.23ms. Allocated memory is still 123.7MB. Free memory was 51.6MB in the beginning and 69.2MB in the end (delta: -17.6MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * RCFGBuilder took 5848.46ms. Allocated memory was 123.7MB in the beginning and 666.9MB in the end (delta: 543.2MB). Free memory was 69.2MB in the beginning and 306.8MB in the end (delta: -237.7MB). Peak memory consumption was 397.9MB. Max. memory is 16.1GB. * TraceAbstraction took 280574.07ms. Allocated memory was 666.9MB in the beginning and 954.2MB in the end (delta: 287.3MB). Free memory was 306.8MB in the beginning and 525.4MB in the end (delta: -218.6MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. * Witness Printer took 552.25ms. Allocated memory is still 954.2MB. Free memory was 525.4MB in the beginning and 835.8MB in the end (delta: -310.4MB). Peak memory consumption was 207.6MB. 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: 280459.61ms, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 16.30ms, AutomataDifference: 64387.64ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 3218.49ms, InitialAbstractionConstructionTime: 6.12ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 17 mSolverCounterUnknown, 929 SdHoareTripleChecker+Valid, 53682.39ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 929 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 51356.29ms 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, 68.15ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 892 GetRequests, 643 SyntacticMatches, 3 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 27833.11ms 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: 77.18ms AutomataMinimizationTime, 17 MinimizatonAttempts, 116 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 699 HoareAnnotationTreeSize, 6 FomulaSimplifications, 759 FormulaSimplificationTreeSizeReduction, 94.46ms HoareSimplificationTime, 6 FomulaSimplificationsInter, 446 FormulaSimplificationTreeSizeReductionInter, 3116.50ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1345.10ms SsaConstructionTime, 122186.06ms SatisfiabilityAnalysisTime, 83783.86ms 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-01 10:07:35,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:35,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:35,555 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-01 10:07:35,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:35,555 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-01 10:07:35,556 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-01 10:07:35,556 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-01 10:07:35,556 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:35,556 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-01 10:07:35,556 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-01 10:07:35,556 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-01 10:07:35,556 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,557 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-01 10:07:35,557 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-01 10:07:35,557 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,557 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-01 10:07:35,557 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-01 10:07:35,557 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:35,558 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-01 10:07:35,558 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,558 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-01 10:07:35,558 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,558 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-01 10:07:35,558 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-01 10:07:35,558 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-01 10:07:35,559 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:35,559 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-01 10:07:35,559 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-01 10:07:35,559 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-01 10:07:35,559 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-01 10:07:35,559 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-01 10:07:35,559 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-01 10:07:35,560 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-01 10:07:35,560 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-01 10:07:35,560 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-01 10:07:35,560 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,560 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-01 10:07:35,560 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-01 10:07:35,560 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-01 10:07:35,560 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-01 10:07:35,561 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-01 10:07:35,561 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-01 10:07:35,561 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-01 10:07:35,561 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-01 10:07:35,561 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-01 10:07:35,561 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,561 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-01 10:07:35,562 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-01 10:07:35,562 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-01 10:07:35,562 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-01 10:07:35,562 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-01 10:07:35,562 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-01 10:07:35,563 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:35,563 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-01 10:07:35,563 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-01 10:07:35,563 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-01 10:07:35,564 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:35,564 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-01 10:07:35,564 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-01 10:07:35,564 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-01 10:07:35,564 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,564 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-01 10:07:35,564 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-01 10:07:35,565 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,565 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-01 10:07:35,565 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-01 10:07:35,565 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:35,565 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-01 10:07:35,565 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,565 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-01 10:07:35,566 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,566 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-01 10:07:35,566 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-01 10:07:35,566 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-01 10:07:35,566 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:35,566 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-01 10:07:35,566 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-01 10:07:35,567 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-01 10:07:35,567 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-01 10:07:35,568 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-01 10:07:35,568 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-01 10:07:35,569 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-01 10:07:35,569 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-01 10:07:35,569 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-01 10:07:35,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,569 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-01 10:07:35,569 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-01 10:07:35,570 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-01 10:07:35,570 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-01 10:07:35,571 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-01 10:07:35,571 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-01 10:07:35,571 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-01 10:07:35,571 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_aws_byte_cursor_from_array_~len,QUANTIFIED] [2021-11-01 10:07:35,572 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-01 10:07:35,572 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,572 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-01 10:07:35,572 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-01 10:07:35,572 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-01 10:07:35,572 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-01 10:07:35,572 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-01 10:07:35,572 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-01 10:07:35,574 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,575 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,575 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:35,576 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,579 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-01 10:07:35,580 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-01 10:07:35,580 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-01 10:07:35,580 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-01 10:07:35,581 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-01 10:07:35,581 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-01 10:07:35,581 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-01 10:07:35,581 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-01 10:07:35,581 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-01 10:07:35,581 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-01 10:07:35,581 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-01 10:07:35,582 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-01 10:07:35,582 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-01 10:07:35,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:35,582 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-01 10:07:35,582 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-01 10:07:35,582 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-01 10:07:35,582 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-01 10:07:35,583 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-01 10:07:35,583 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-01 10:07:35,583 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-01 10:07:35,583 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-01 10:07:35,584 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-01 10:07:35,584 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-01 10:07:35,584 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-01 10:07:35,584 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-01 10:07:35,584 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-01 10:07:35,584 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-01 10:07:35,585 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-01 10:07:35,585 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-01 10:07:35,585 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-01 10:07:35,585 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-01 10:07:35,585 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-01 10:07:35,585 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-01 10:07:35,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:07:35,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:07:35,586 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-01 10:07:35,586 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-01 10:07:35,586 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-01 10:07:35,586 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-01 10:07:35,586 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-01 10:07:35,587 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-01 10:07:35,587 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-01 10:07:35,587 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-01 10:07:35,684 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...