./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_swap_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_hash_table_swap_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 50333b6a17e96dff6400d2c6a85c0145ae494daf76266f6b6d6936a12a6b2527 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:29:11,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-01 10:29:11,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-01 10:29:12,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-01 10:29:12,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-01 10:29:12,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-01 10:29:12,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-01 10:29:12,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-01 10:29:12,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-01 10:29:12,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-01 10:29:12,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-01 10:29:12,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-01 10:29:12,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-01 10:29:12,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-01 10:29:12,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-01 10:29:12,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-01 10:29:12,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-01 10:29:12,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-01 10:29:12,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-01 10:29:12,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-01 10:29:12,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-01 10:29:12,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-01 10:29:12,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-01 10:29:12,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-01 10:29:12,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-01 10:29:12,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-01 10:29:12,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-01 10:29:12,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-01 10:29:12,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-01 10:29:12,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-01 10:29:12,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-01 10:29:12,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-01 10:29:12,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-01 10:29:12,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-01 10:29:12,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-01 10:29:12,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-01 10:29:12,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-01 10:29:12,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-01 10:29:12,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-01 10:29:12,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-01 10:29:12,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-01 10:29:12,071 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:29:12,098 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-01 10:29:12,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-01 10:29:12,099 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-01 10:29:12,099 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-01 10:29:12,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-01 10:29:12,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-01 10:29:12,101 INFO L138 SettingsManager]: * Use SBE=true [2021-11-01 10:29:12,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-01 10:29:12,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-01 10:29:12,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-01 10:29:12,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-01 10:29:12,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-01 10:29:12,103 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-01 10:29:12,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-01 10:29:12,103 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-01 10:29:12,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-01 10:29:12,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-01 10:29:12,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-01 10:29:12,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-01 10:29:12,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-01 10:29:12,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-01 10:29:12,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-01 10:29:12,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-01 10:29:12,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-01 10:29:12,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-01 10:29:12,105 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-01 10:29:12,105 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-01 10:29:12,106 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-01 10:29:12,106 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-01 10:29:12,106 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 -> 50333b6a17e96dff6400d2c6a85c0145ae494daf76266f6b6d6936a12a6b2527 [2021-11-01 10:29:12,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-01 10:29:12,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-01 10:29:12,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-01 10:29:12,328 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-01 10:29:12,330 INFO L275 PluginConnector]: CDTParser initialized [2021-11-01 10:29:12,331 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_swap_harness.i [2021-11-01 10:29:12,390 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f4fd0c16/b7b5710e756247d6b17112e2e253865d/FLAG745cc91a9 [2021-11-01 10:29:13,021 INFO L306 CDTParser]: Found 1 translation units. [2021-11-01 10:29:13,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_swap_harness.i [2021-11-01 10:29:13,049 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f4fd0c16/b7b5710e756247d6b17112e2e253865d/FLAG745cc91a9 [2021-11-01 10:29:13,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f4fd0c16/b7b5710e756247d6b17112e2e253865d [2021-11-01 10:29:13,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-01 10:29:13,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-01 10:29:13,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-01 10:29:13,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-01 10:29:13,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-01 10:29:13,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 10:29:13" (1/1) ... [2021-11-01 10:29:13,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38f74006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:29:13, skipping insertion in model container [2021-11-01 10:29:13,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 10:29:13" (1/1) ... [2021-11-01 10:29:13,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-01 10:29:13,513 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-01 10:29:13,763 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_hash_table_swap_harness.i[4493,4506] [2021-11-01 10:29:13,771 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_hash_table_swap_harness.i[4553,4566] [2021-11-01 10:29:13,800 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-01 10:29:13,808 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-01 10:29:14,445 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:14,446 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:14,446 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:14,447 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:14,447 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:14,455 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:14,461 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:14,462 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:14,463 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:14,464 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:14,465 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:14,465 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:14,465 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:14,722 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-01 10:29:14,723 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-01 10:29:14,724 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-01 10:29:14,725 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-01 10:29:14,726 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-01 10:29:14,726 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-01 10:29:14,727 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-01 10:29:14,727 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-01 10:29:14,728 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-01 10:29:14,728 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-01 10:29:14,869 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-01 10:29:15,166 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,168 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,198 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,200 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,208 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,209 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,227 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,229 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,229 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,230 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,230 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,230 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,231 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-01 10:29:15,305 INFO L203 MainTranslator]: Completed pre-run [2021-11-01 10:29:15,324 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_hash_table_swap_harness.i[4493,4506] [2021-11-01 10:29:15,325 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_hash_table_swap_harness.i[4553,4566] [2021-11-01 10:29:15,327 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-01 10:29:15,327 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-01 10:29:15,362 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,363 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,363 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,363 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,364 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,371 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,372 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,373 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,373 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,374 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,375 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,375 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,376 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,437 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-01 10:29:15,438 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-01 10:29:15,438 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-01 10:29:15,439 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-01 10:29:15,440 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-01 10:29:15,440 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-01 10:29:15,440 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-01 10:29:15,440 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-01 10:29:15,455 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-01 10:29:15,456 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-01 10:29:15,489 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-01 10:29:15,582 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,582 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,588 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,589 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,591 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,592 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,603 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,604 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,606 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,606 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,606 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,607 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,607 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:29:15,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-01 10:29:15,826 INFO L208 MainTranslator]: Completed translation [2021-11-01 10:29:15,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:29:15 WrapperNode [2021-11-01 10:29:15,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-01 10:29:15,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-01 10:29:15,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-01 10:29:15,828 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-01 10:29:15,834 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:29:15" (1/1) ... [2021-11-01 10:29:15,931 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:29:15" (1/1) ... [2021-11-01 10:29:16,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-01 10:29:16,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-01 10:29:16,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-01 10:29:16,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-01 10:29:16,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:29:15" (1/1) ... [2021-11-01 10:29:16,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:29:15" (1/1) ... [2021-11-01 10:29:16,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:29:15" (1/1) ... [2021-11-01 10:29:16,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:29:15" (1/1) ... [2021-11-01 10:29:16,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:29:15" (1/1) ... [2021-11-01 10:29:16,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:29:15" (1/1) ... [2021-11-01 10:29:16,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:29:15" (1/1) ... [2021-11-01 10:29:16,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-01 10:29:16,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-01 10:29:16,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-01 10:29:16,120 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-01 10:29:16,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:29:15" (1/1) ... [2021-11-01 10:29:16,139 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-01 10:29:16,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 10:29:16,173 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:29:16,193 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:29:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-01 10:29:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-01 10:29:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-01 10:29:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-01 10:29:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-01 10:29:16,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-01 10:29:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-11-01 10:29:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-01 10:29:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-01 10:29:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-01 10:29:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-01 10:29:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-01 10:29:16,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-01 10:29:16,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-01 10:29:20,408 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-01 10:29:20,409 INFO L299 CfgBuilder]: Removed 190 assume(true) statements. [2021-11-01 10:29:20,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 10:29:20 BoogieIcfgContainer [2021-11-01 10:29:20,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-01 10:29:20,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-01 10:29:20,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-01 10:29:20,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-01 10:29:20,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 10:29:13" (1/3) ... [2021-11-01 10:29:20,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5039b558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 10:29:20, skipping insertion in model container [2021-11-01 10:29:20,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:29:15" (2/3) ... [2021-11-01 10:29:20,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5039b558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 10:29:20, skipping insertion in model container [2021-11-01 10:29:20,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 10:29:20" (3/3) ... [2021-11-01 10:29:20,418 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_swap_harness.i [2021-11-01 10:29:20,422 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-01 10:29:20,422 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-01 10:29:20,456 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-01 10:29:20,461 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:29:20,462 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-01 10:29:20,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 159 states have (on average 1.3584905660377358) internal successors, (216), 163 states have internal predecessors, (216), 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:29:20,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-01 10:29:20,480 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:29:20,481 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:29:20,481 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-01 10:29:20,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:29:20,486 INFO L85 PathProgramCache]: Analyzing trace with hash 67832654, now seen corresponding path program 1 times [2021-11-01 10:29:20,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:29:20,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216821528] [2021-11-01 10:29:20,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:29:20,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:29:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:29:21,031 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:29:21,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:29:21,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216821528] [2021-11-01 10:29:21,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216821528] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:29:21,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:29:21,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-01 10:29:21,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886444313] [2021-11-01 10:29:21,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-01 10:29:21,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:29:21,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-01 10:29:21,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-01 10:29:21,074 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.3584905660377358) internal successors, (216), 163 states have internal predecessors, (216), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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:29:23,155 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:29:24,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:29:24,229 INFO L93 Difference]: Finished difference Result 323 states and 425 transitions. [2021-11-01 10:29:24,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-01 10:29:24,232 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2021-11-01 10:29:24,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:29:24,238 INFO L225 Difference]: With dead ends: 323 [2021-11-01 10:29:24,238 INFO L226 Difference]: Without dead ends: 158 [2021-11-01 10:29:24,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.03ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-01 10:29:24,249 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2793.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.98ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3075.78ms IncrementalHoareTripleChecker+Time [2021-11-01 10:29:24,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 197 Unknown, 0 Unchecked, 3.98ms Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 1 Unknown, 0 Unchecked, 3075.78ms Time] [2021-11-01 10:29:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-11-01 10:29:24,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2021-11-01 10:29:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 154 states have (on average 1.2337662337662338) internal successors, (190), 157 states have internal predecessors, (190), 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:29:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 190 transitions. [2021-11-01 10:29:24,300 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 190 transitions. Word has length 15 [2021-11-01 10:29:24,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:29:24,301 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 190 transitions. [2021-11-01 10:29:24,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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:29:24,304 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 190 transitions. [2021-11-01 10:29:24,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-01 10:29:24,306 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:29:24,306 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:29:24,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-01 10:29:24,306 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-01 10:29:24,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:29:24,309 INFO L85 PathProgramCache]: Analyzing trace with hash -325194356, now seen corresponding path program 1 times [2021-11-01 10:29:24,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:29:24,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456902466] [2021-11-01 10:29:24,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:29:24,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:29:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:29:24,539 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:29:24,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:29:24,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456902466] [2021-11-01 10:29:24,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456902466] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:29:24,540 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:29:24,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-01 10:29:24,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262224832] [2021-11-01 10:29:24,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 10:29:24,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:29:24,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 10:29:24,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 10:29:24,543 INFO L87 Difference]: Start difference. First operand 158 states and 190 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:29:26,598 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:29:28,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:29:28,547 INFO L93 Difference]: Finished difference Result 270 states and 323 transitions. [2021-11-01 10:29:28,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 10:29:28,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2021-11-01 10:29:28,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:29:28,551 INFO L225 Difference]: With dead ends: 270 [2021-11-01 10:29:28,551 INFO L226 Difference]: Without dead ends: 238 [2021-11-01 10:29:28,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.48ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 10:29:28,552 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3537.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.75ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3927.10ms IncrementalHoareTripleChecker+Time [2021-11-01 10:29:28,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 378 Unknown, 0 Unchecked, 10.75ms Time], IncrementalHoareTripleChecker [1 Valid, 376 Invalid, 1 Unknown, 0 Unchecked, 3927.10ms Time] [2021-11-01 10:29:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-11-01 10:29:28,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 222. [2021-11-01 10:29:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 218 states have (on average 1.224770642201835) internal successors, (267), 221 states have internal predecessors, (267), 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:29:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 267 transitions. [2021-11-01 10:29:28,586 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 267 transitions. Word has length 15 [2021-11-01 10:29:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:29:28,586 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 267 transitions. [2021-11-01 10:29:28,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:29:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 267 transitions. [2021-11-01 10:29:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-01 10:29:28,586 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:29:28,587 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:29:28,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-01 10:29:28,587 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-01 10:29:28,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:29:28,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1994950714, now seen corresponding path program 1 times [2021-11-01 10:29:28,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:29:28,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219537487] [2021-11-01 10:29:28,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:29:28,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:29:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:29:28,771 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:29:28,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:29:28,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219537487] [2021-11-01 10:29:28,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219537487] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:29:28,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:29:28,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-01 10:29:28,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191088932] [2021-11-01 10:29:28,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-01 10:29:28,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:29:28,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-01 10:29:28,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 10:29:28,776 INFO L87 Difference]: Start difference. First operand 222 states and 267 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:29:30,817 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:29:32,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:29:32,502 INFO L93 Difference]: Finished difference Result 262 states and 313 transitions. [2021-11-01 10:29:32,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-01 10:29:32,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2021-11-01 10:29:32,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:29:32,506 INFO L225 Difference]: With dead ends: 262 [2021-11-01 10:29:32,506 INFO L226 Difference]: Without dead ends: 241 [2021-11-01 10:29:32,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.53ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-01 10:29:32,519 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3303.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.05ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3667.51ms IncrementalHoareTripleChecker+Time [2021-11-01 10:29:32,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 378 Unknown, 0 Unchecked, 16.05ms Time], IncrementalHoareTripleChecker [0 Valid, 377 Invalid, 1 Unknown, 0 Unchecked, 3667.51ms Time] [2021-11-01 10:29:32,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-11-01 10:29:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 237. [2021-11-01 10:29:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 233 states have (on average 1.2231759656652361) internal successors, (285), 236 states have internal predecessors, (285), 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:29:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 285 transitions. [2021-11-01 10:29:32,539 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 285 transitions. Word has length 16 [2021-11-01 10:29:32,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:29:32,539 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 285 transitions. [2021-11-01 10:29:32,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:29:32,540 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 285 transitions. [2021-11-01 10:29:32,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-01 10:29:32,541 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:29:32,541 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, 1, 1, 1, 1, 1, 1] [2021-11-01 10:29:32,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-01 10:29:32,542 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-01 10:29:32,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:29:32,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1734286995, now seen corresponding path program 1 times [2021-11-01 10:29:32,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:29:32,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021775537] [2021-11-01 10:29:32,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:29:32,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:29:32,617 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-01 10:29:32,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [589163751] [2021-11-01 10:29:32,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:29:32,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-01 10:29:32,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 10:29:32,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-01 10:29:32,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-01 10:29:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:29:33,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 2525 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-01 10:29:33,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:29:33,700 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:29:33,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-01 10:29:33,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:29:33,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021775537] [2021-11-01 10:29:33,701 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-01 10:29:33,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589163751] [2021-11-01 10:29:33,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589163751] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:29:33,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:29:33,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-01 10:29:33,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472144829] [2021-11-01 10:29:33,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-01 10:29:33,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:29:33,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-01 10:29:33,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-01 10:29:33,703 INFO L87 Difference]: Start difference. First operand 237 states and 285 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:29:35,746 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:29:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:29:39,929 INFO L93 Difference]: Finished difference Result 627 states and 755 transitions. [2021-11-01 10:29:39,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-01 10:29:39,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 50 [2021-11-01 10:29:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:29:39,932 INFO L225 Difference]: With dead ends: 627 [2021-11-01 10:29:39,932 INFO L226 Difference]: Without dead ends: 434 [2021-11-01 10:29:39,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 129.44ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-01 10:29:39,934 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 294 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5501.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.33ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6045.75ms IncrementalHoareTripleChecker+Time [2021-11-01 10:29:39,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 0 Invalid, 995 Unknown, 0 Unchecked, 18.33ms Time], IncrementalHoareTripleChecker [20 Valid, 974 Invalid, 1 Unknown, 0 Unchecked, 6045.75ms Time] [2021-11-01 10:29:39,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-11-01 10:29:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 255. [2021-11-01 10:29:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 251 states have (on average 1.207171314741036) internal successors, (303), 254 states have internal predecessors, (303), 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:29:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 303 transitions. [2021-11-01 10:29:39,952 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 303 transitions. Word has length 50 [2021-11-01 10:29:39,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:29:39,952 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 303 transitions. [2021-11-01 10:29:39,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:29:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 303 transitions. [2021-11-01 10:29:39,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-01 10:29:39,958 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:29:39,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:29:39,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-01 10:29:40,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-01 10:29:40,180 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-01 10:29:40,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:29:40,180 INFO L85 PathProgramCache]: Analyzing trace with hash -569476781, now seen corresponding path program 1 times [2021-11-01 10:29:40,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:29:40,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520386034] [2021-11-01 10:29:40,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:29:40,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:29:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:29:40,721 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:29:40,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:29:40,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520386034] [2021-11-01 10:29:40,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520386034] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:29:40,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:29:40,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-01 10:29:40,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395465978] [2021-11-01 10:29:40,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-01 10:29:40,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:29:40,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-01 10:29:40,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-01 10:29:40,723 INFO L87 Difference]: Start difference. First operand 255 states and 303 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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:29:42,805 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:29:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:29:48,144 INFO L93 Difference]: Finished difference Result 454 states and 538 transitions. [2021-11-01 10:29:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-01 10:29:48,144 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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 54 [2021-11-01 10:29:48,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:29:48,145 INFO L225 Difference]: With dead ends: 454 [2021-11-01 10:29:48,145 INFO L226 Difference]: Without dead ends: 308 [2021-11-01 10:29:48,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 580.89ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-11-01 10:29:48,147 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 260 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6438.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.37ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6955.73ms IncrementalHoareTripleChecker+Time [2021-11-01 10:29:48,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 0 Invalid, 1367 Unknown, 0 Unchecked, 20.37ms Time], IncrementalHoareTripleChecker [8 Valid, 1358 Invalid, 1 Unknown, 0 Unchecked, 6955.73ms Time] [2021-11-01 10:29:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-11-01 10:29:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 257. [2021-11-01 10:29:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 1.2055335968379446) internal successors, (305), 256 states have internal predecessors, (305), 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:29:48,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 305 transitions. [2021-11-01 10:29:48,156 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 305 transitions. Word has length 54 [2021-11-01 10:29:48,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:29:48,156 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 305 transitions. [2021-11-01 10:29:48,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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:29:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 305 transitions. [2021-11-01 10:29:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-01 10:29:48,159 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:29:48,159 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:29:48,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-01 10:29:48,160 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-01 10:29:48,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:29:48,160 INFO L85 PathProgramCache]: Analyzing trace with hash 132123093, now seen corresponding path program 1 times [2021-11-01 10:29:48,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:29:48,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203713438] [2021-11-01 10:29:48,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:29:48,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:29:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:29:48,435 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:29:48,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:29:48,436 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203713438] [2021-11-01 10:29:48,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203713438] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:29:48,436 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:29:48,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-01 10:29:48,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313618545] [2021-11-01 10:29:48,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 10:29:48,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:29:48,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 10:29:48,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-01 10:29:48,437 INFO L87 Difference]: Start difference. First operand 257 states and 305 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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:29:50,478 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:29:52,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:29:52,025 INFO L93 Difference]: Finished difference Result 406 states and 483 transitions. [2021-11-01 10:29:52,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 10:29:52,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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 54 [2021-11-01 10:29:52,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:29:52,026 INFO L225 Difference]: With dead ends: 406 [2021-11-01 10:29:52,026 INFO L226 Difference]: Without dead ends: 255 [2021-11-01 10:29:52,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.73ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-01 10:29:52,027 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 162 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3150.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.84ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3544.32ms IncrementalHoareTripleChecker+Time [2021-11-01 10:29:52,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 0 Invalid, 375 Unknown, 0 Unchecked, 5.84ms Time], IncrementalHoareTripleChecker [4 Valid, 370 Invalid, 1 Unknown, 0 Unchecked, 3544.32ms Time] [2021-11-01 10:29:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-11-01 10:29:52,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2021-11-01 10:29:52,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 251 states have (on average 1.1952191235059761) internal successors, (300), 254 states have internal predecessors, (300), 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:29:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 300 transitions. [2021-11-01 10:29:52,035 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 300 transitions. Word has length 54 [2021-11-01 10:29:52,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:29:52,035 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 300 transitions. [2021-11-01 10:29:52,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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:29:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 300 transitions. [2021-11-01 10:29:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-01 10:29:52,038 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:29:52,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:29:52,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-01 10:29:52,038 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-01 10:29:52,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:29:52,039 INFO L85 PathProgramCache]: Analyzing trace with hash 844082519, now seen corresponding path program 1 times [2021-11-01 10:29:52,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:29:52,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56125763] [2021-11-01 10:29:52,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:29:52,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:29:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:29:52,414 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:29:52,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:29:52,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56125763] [2021-11-01 10:29:52,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56125763] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:29:52,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:29:52,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-01 10:29:52,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738993789] [2021-11-01 10:29:52,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-01 10:29:52,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:29:52,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-01 10:29:52,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-01 10:29:52,415 INFO L87 Difference]: Start difference. First operand 255 states and 300 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 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:29:54,471 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:29:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:29:59,198 INFO L93 Difference]: Finished difference Result 401 states and 469 transitions. [2021-11-01 10:29:59,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-01 10:29:59,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 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) Word has length 55 [2021-11-01 10:29:59,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:29:59,200 INFO L225 Difference]: With dead ends: 401 [2021-11-01 10:29:59,200 INFO L226 Difference]: Without dead ends: 303 [2021-11-01 10:29:59,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 513.93ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-01 10:29:59,201 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 313 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5752.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.17ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6348.34ms IncrementalHoareTripleChecker+Time [2021-11-01 10:29:59,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 0 Invalid, 1139 Unknown, 0 Unchecked, 17.17ms Time], IncrementalHoareTripleChecker [10 Valid, 1128 Invalid, 1 Unknown, 0 Unchecked, 6348.34ms Time] [2021-11-01 10:29:59,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-11-01 10:29:59,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 259. [2021-11-01 10:29:59,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 255 states have (on average 1.192156862745098) internal successors, (304), 258 states have internal predecessors, (304), 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:29:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 304 transitions. [2021-11-01 10:29:59,217 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 304 transitions. Word has length 55 [2021-11-01 10:29:59,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:29:59,218 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 304 transitions. [2021-11-01 10:29:59,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 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:29:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 304 transitions. [2021-11-01 10:29:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-01 10:29:59,219 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:29:59,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:29:59,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-01 10:29:59,219 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-01 10:29:59,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:29:59,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1545682393, now seen corresponding path program 1 times [2021-11-01 10:29:59,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:29:59,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534913215] [2021-11-01 10:29:59,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:29:59,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:29:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:29:59,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:29:59,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:29:59,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534913215] [2021-11-01 10:29:59,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534913215] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:29:59,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:29:59,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-01 10:29:59,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908947210] [2021-11-01 10:29:59,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 10:29:59,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:29:59,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 10:29:59,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-01 10:29:59,442 INFO L87 Difference]: Start difference. First operand 259 states and 304 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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:30:01,921 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:30:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:30:03,698 INFO L93 Difference]: Finished difference Result 373 states and 438 transitions. [2021-11-01 10:30:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 10:30:03,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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) Word has length 55 [2021-11-01 10:30:03,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:30:03,700 INFO L225 Difference]: With dead ends: 373 [2021-11-01 10:30:03,700 INFO L226 Difference]: Without dead ends: 255 [2021-11-01 10:30:03,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.36ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-01 10:30:03,701 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 159 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3763.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.70ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4210.22ms IncrementalHoareTripleChecker+Time [2021-11-01 10:30:03,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 0 Invalid, 369 Unknown, 0 Unchecked, 3.70ms Time], IncrementalHoareTripleChecker [4 Valid, 364 Invalid, 1 Unknown, 0 Unchecked, 4210.22ms Time] [2021-11-01 10:30:03,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-11-01 10:30:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2021-11-01 10:30:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 251 states have (on average 1.1713147410358566) internal successors, (294), 254 states have internal predecessors, (294), 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:30:03,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 294 transitions. [2021-11-01 10:30:03,710 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 294 transitions. Word has length 55 [2021-11-01 10:30:03,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:30:03,711 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 294 transitions. [2021-11-01 10:30:03,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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:30:03,711 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 294 transitions. [2021-11-01 10:30:03,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-01 10:30:03,711 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:30:03,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:30:03,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-01 10:30:03,712 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-01 10:30:03,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:30:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash 209502350, now seen corresponding path program 1 times [2021-11-01 10:30:03,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:30:03,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568015551] [2021-11-01 10:30:03,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:30:03,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:30:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:30:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 10:30:04,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:30:04,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568015551] [2021-11-01 10:30:04,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568015551] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:30:04,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:30:04,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-01 10:30:04,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106340755] [2021-11-01 10:30:04,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-01 10:30:04,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:30:04,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-01 10:30:04,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-01 10:30:04,024 INFO L87 Difference]: Start difference. First operand 255 states and 294 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:30:06,494 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:30:09,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:30:09,446 INFO L93 Difference]: Finished difference Result 439 states and 506 transitions. [2021-11-01 10:30:09,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-01 10:30:09,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 56 [2021-11-01 10:30:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:30:09,447 INFO L225 Difference]: With dead ends: 439 [2021-11-01 10:30:09,447 INFO L226 Difference]: Without dead ends: 258 [2021-11-01 10:30:09,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 350.84ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-01 10:30:09,448 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4585.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.08ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5112.50ms IncrementalHoareTripleChecker+Time [2021-11-01 10:30:09,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 682 Unknown, 0 Unchecked, 7.08ms Time], IncrementalHoareTripleChecker [18 Valid, 663 Invalid, 1 Unknown, 0 Unchecked, 5112.50ms Time] [2021-11-01 10:30:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-01 10:30:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 255. [2021-11-01 10:30:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 251 states have (on average 1.1474103585657371) internal successors, (288), 254 states have internal predecessors, (288), 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:30:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 288 transitions. [2021-11-01 10:30:09,458 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 288 transitions. Word has length 56 [2021-11-01 10:30:09,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:30:09,458 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 288 transitions. [2021-11-01 10:30:09,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:30:09,459 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 288 transitions. [2021-11-01 10:30:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-01 10:30:09,459 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:30:09,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:30:09,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-01 10:30:09,460 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-01 10:30:09,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:30:09,460 INFO L85 PathProgramCache]: Analyzing trace with hash -693818886, now seen corresponding path program 1 times [2021-11-01 10:30:09,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:30:09,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117309135] [2021-11-01 10:30:09,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:30:09,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:30:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:30:12,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:30:12,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:30:12,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117309135] [2021-11-01 10:30:12,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117309135] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:30:12,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:30:12,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-01 10:30:12,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125540479] [2021-11-01 10:30:12,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-01 10:30:12,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:30:12,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-01 10:30:12,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-11-01 10:30:12,129 INFO L87 Difference]: Start difference. First operand 255 states and 288 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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:30:14,169 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:30:28,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:30:28,481 INFO L93 Difference]: Finished difference Result 336 states and 378 transitions. [2021-11-01 10:30:28,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-01 10:30:28,481 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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) Word has length 57 [2021-11-01 10:30:28,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:30:28,484 INFO L225 Difference]: With dead ends: 336 [2021-11-01 10:30:28,484 INFO L226 Difference]: Without dead ends: 327 [2021-11-01 10:30:28,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 4270.50ms TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2021-11-01 10:30:28,485 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 397 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 3196 mSolverCounterSat, 83 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12260.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 39.53ms SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3196 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13330.16ms IncrementalHoareTripleChecker+Time [2021-11-01 10:30:28,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 0 Invalid, 3280 Unknown, 0 Unchecked, 39.53ms Time], IncrementalHoareTripleChecker [83 Valid, 3196 Invalid, 1 Unknown, 0 Unchecked, 13330.16ms Time] [2021-11-01 10:30:28,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-11-01 10:30:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 275. [2021-11-01 10:30:28,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 271 states have (on average 1.151291512915129) internal successors, (312), 274 states have internal predecessors, (312), 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:30:28,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 312 transitions. [2021-11-01 10:30:28,496 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 312 transitions. Word has length 57 [2021-11-01 10:30:28,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:30:28,497 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 312 transitions. [2021-11-01 10:30:28,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 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:30:28,497 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 312 transitions. [2021-11-01 10:30:28,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-01 10:30:28,498 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:30:28,498 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:30:28,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-01 10:30:28,498 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-01 10:30:28,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:30:28,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1205998898, now seen corresponding path program 1 times [2021-11-01 10:30:28,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:30:28,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538513474] [2021-11-01 10:30:28,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:30:28,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:30:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:30:29,607 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:30:29,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:30:29,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538513474] [2021-11-01 10:30:29,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538513474] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:30:29,608 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:30:29,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-01 10:30:29,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358720512] [2021-11-01 10:30:29,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-01 10:30:29,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:30:29,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-01 10:30:29,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-01 10:30:29,609 INFO L87 Difference]: Start difference. First operand 275 states and 312 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 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:30:31,655 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:30:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:30:39,591 INFO L93 Difference]: Finished difference Result 354 states and 396 transitions. [2021-11-01 10:30:39,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-01 10:30:39,591 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 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 58 [2021-11-01 10:30:39,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:30:39,592 INFO L225 Difference]: With dead ends: 354 [2021-11-01 10:30:39,592 INFO L226 Difference]: Without dead ends: 345 [2021-11-01 10:30:39,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1711.31ms TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2021-11-01 10:30:39,593 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 455 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7683.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.78ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8684.01ms IncrementalHoareTripleChecker+Time [2021-11-01 10:30:39,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [455 Valid, 0 Invalid, 1784 Unknown, 0 Unchecked, 22.78ms Time], IncrementalHoareTripleChecker [12 Valid, 1771 Invalid, 1 Unknown, 0 Unchecked, 8684.01ms Time] [2021-11-01 10:30:39,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-11-01 10:30:39,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 323. [2021-11-01 10:30:39,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 319 states have (on average 1.1598746081504703) internal successors, (370), 322 states have internal predecessors, (370), 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:30:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 370 transitions. [2021-11-01 10:30:39,638 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 370 transitions. Word has length 58 [2021-11-01 10:30:39,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:30:39,638 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 370 transitions. [2021-11-01 10:30:39,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 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:30:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 370 transitions. [2021-11-01 10:30:39,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-01 10:30:39,639 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:30:39,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:30:39,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-01 10:30:39,639 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-01 10:30:39,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:30:39,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1380900098, now seen corresponding path program 1 times [2021-11-01 10:30:39,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:30:39,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606169293] [2021-11-01 10:30:39,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:30:39,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:30:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:30:40,571 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:30:40,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:30:40,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606169293] [2021-11-01 10:30:40,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606169293] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:30:40,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:30:40,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-01 10:30:40,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304449601] [2021-11-01 10:30:40,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 10:30:40,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:30:40,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 10:30:40,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 10:30:40,573 INFO L87 Difference]: Start difference. First operand 323 states and 370 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:30:43,721 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:30:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:30:46,045 INFO L93 Difference]: Finished difference Result 610 states and 695 transitions. [2021-11-01 10:30:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 10:30:46,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2021-11-01 10:30:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:30:46,046 INFO L225 Difference]: With dead ends: 610 [2021-11-01 10:30:46,047 INFO L226 Difference]: Without dead ends: 323 [2021-11-01 10:30:46,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 80.46ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-01 10:30:46,047 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4865.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.00ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5386.76ms IncrementalHoareTripleChecker+Time [2021-11-01 10:30:46,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 543 Unknown, 0 Unchecked, 3.00ms Time], IncrementalHoareTripleChecker [13 Valid, 529 Invalid, 1 Unknown, 0 Unchecked, 5386.76ms Time] [2021-11-01 10:30:46,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-11-01 10:30:46,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 314. [2021-11-01 10:30:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 310 states have (on average 1.1161290322580646) internal successors, (346), 313 states have internal predecessors, (346), 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:30:46,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 346 transitions. [2021-11-01 10:30:46,059 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 346 transitions. Word has length 60 [2021-11-01 10:30:46,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:30:46,059 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 346 transitions. [2021-11-01 10:30:46,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:30:46,059 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 346 transitions. [2021-11-01 10:30:46,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-01 10:30:46,060 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:30:46,060 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:30:46,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-01 10:30:46,060 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-01 10:30:46,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:30:46,061 INFO L85 PathProgramCache]: Analyzing trace with hash 778166894, now seen corresponding path program 1 times [2021-11-01 10:30:46,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:30:46,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631602422] [2021-11-01 10:30:46,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:30:46,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:30:46,110 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-01 10:30:46,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2088133564] [2021-11-01 10:30:46,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:30:46,111 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-01 10:30:46,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 10:30:46,139 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-01 10:30:46,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-01 10:30:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:30:46,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 2717 conjuncts, 87 conjunts are in the unsatisfiable core [2021-11-01 10:30:46,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:30:48,409 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-01 10:30:48,428 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 53 treesize of output 29 [2021-11-01 10:30:48,438 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 0 case distinctions, treesize of input 26 treesize of output 22 [2021-11-01 10:30:48,813 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 15 treesize of output 7 [2021-11-01 10:30:48,940 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 13 treesize of output 5 [2021-11-01 10:30:49,680 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:30:49,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-01 10:30:49,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:30:49,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631602422] [2021-11-01 10:30:49,681 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-01 10:30:49,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088133564] [2021-11-01 10:30:49,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088133564] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:30:49,681 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:30:49,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-01 10:30:49,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191011649] [2021-11-01 10:30:49,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-01 10:30:49,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:30:49,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-01 10:30:49,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-01 10:30:49,682 INFO L87 Difference]: Start difference. First operand 314 states and 346 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 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:30:52,944 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:31:01,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:31:01,405 INFO L93 Difference]: Finished difference Result 334 states and 366 transitions. [2021-11-01 10:31:01,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-01 10:31:01,406 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 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 63 [2021-11-01 10:31:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:31:01,407 INFO L225 Difference]: With dead ends: 334 [2021-11-01 10:31:01,407 INFO L226 Difference]: Without dead ends: 106 [2021-11-01 10:31:01,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 4209.33ms TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2021-11-01 10:31:01,408 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 175 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7709.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.86ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8495.04ms IncrementalHoareTripleChecker+Time [2021-11-01 10:31:01,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 0 Invalid, 1391 Unknown, 0 Unchecked, 14.86ms Time], IncrementalHoareTripleChecker [21 Valid, 1369 Invalid, 1 Unknown, 0 Unchecked, 8495.04ms Time] [2021-11-01 10:31:01,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-11-01 10:31:01,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-11-01 10:31:01,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 1.0865384615384615) internal successors, (113), 105 states have internal predecessors, (113), 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:31:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2021-11-01 10:31:01,416 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 63 [2021-11-01 10:31:01,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:31:01,416 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2021-11-01 10:31:01,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 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:31:01,416 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2021-11-01 10:31:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-01 10:31:01,419 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:31:01,419 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:31:01,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-01 10:31:01,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-01 10:31:01,640 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-01 10:31:01,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:31:01,640 INFO L85 PathProgramCache]: Analyzing trace with hash -135931354, now seen corresponding path program 1 times [2021-11-01 10:31:01,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:31:01,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663044377] [2021-11-01 10:31:01,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:31:01,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:31:01,693 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-01 10:31:01,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1719383598] [2021-11-01 10:31:01,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:31:01,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-01 10:31:01,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 10:31:01,695 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-01 10:31:01,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-01 10:31:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:31:02,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 2719 conjuncts, 83 conjunts are in the unsatisfiable core [2021-11-01 10:31:02,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:31:03,906 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-11-01 10:31:03,906 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 68 treesize of output 42 [2021-11-01 10:31:03,915 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 0 case distinctions, treesize of input 39 treesize of output 35 [2021-11-01 10:31:03,924 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 0 case distinctions, treesize of input 36 treesize of output 32 [2021-11-01 10:31:04,390 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 19 treesize of output 5 [2021-11-01 10:31:05,106 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:31:05,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-01 10:31:05,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:31:05,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663044377] [2021-11-01 10:31:05,107 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-01 10:31:05,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719383598] [2021-11-01 10:31:05,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719383598] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:31:05,107 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:31:05,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-01 10:31:05,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166831216] [2021-11-01 10:31:05,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-01 10:31:05,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:31:05,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-01 10:31:05,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-01 10:31:05,108 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 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:31:08,238 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:31:12,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:31:12,887 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2021-11-01 10:31:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-01 10:31:12,887 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 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 64 [2021-11-01 10:31:12,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:31:12,887 INFO L225 Difference]: With dead ends: 106 [2021-11-01 10:31:12,887 INFO L226 Difference]: Without dead ends: 0 [2021-11-01 10:31:12,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 3983.96ms TimeCoverageRelationStatistics Valid=208, Invalid=494, Unknown=0, NotChecked=0, Total=702 [2021-11-01 10:31:12,888 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4307.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.12ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4774.68ms IncrementalHoareTripleChecker+Time [2021-11-01 10:31:12,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 371 Unknown, 0 Unchecked, 4.12ms Time], IncrementalHoareTripleChecker [21 Valid, 349 Invalid, 1 Unknown, 0 Unchecked, 4774.68ms Time] [2021-11-01 10:31:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-01 10:31:12,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-01 10:31:12,888 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:31:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-01 10:31:12,889 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2021-11-01 10:31:12,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:31:12,889 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-01 10:31:12,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 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:31:12,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-01 10:31:12,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-01 10:31:12,891 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2021-11-01 10:31:12,891 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2021-11-01 10:31:12,891 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2021-11-01 10:31:12,891 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2021-11-01 10:31:12,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-01 10:31:13,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-01 10:31:13,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-01 10:31:13,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:13,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:31:21,621 INFO L854 garLoopResultBuilder]: At program point L10044(lines 9999 10046) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|))) (and |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= .cse0 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ (select (select |#memory_int| .cse0) 40) 1) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0))) [2021-11-01 10:31:21,621 INFO L854 garLoopResultBuilder]: At program point L10044-1(lines 9999 10046) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset|)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset|))) (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset .cse0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) |ULTIMATE.start_aws_hash_table_is_valid_#t~short1475| |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (<= (+ (select (select |#memory_int| .cse1) (+ 40 .cse0)) 1) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.offset) (= .cse1 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (< (+ .cse1 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|))) [2021-11-01 10:31:21,621 INFO L854 garLoopResultBuilder]: At program point L10044-2(lines 9999 10046) the Hoare annotation is: false [2021-11-01 10:31:21,621 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 10:31:21,621 INFO L854 garLoopResultBuilder]: At program point L10044-3(lines 9999 10046) the Hoare annotation is: false [2021-11-01 10:31:21,621 INFO L858 garLoopResultBuilder]: For program point L10144(lines 10114 10152) no Hoare annotation was computed. [2021-11-01 10:31:21,621 INFO L854 garLoopResultBuilder]: At program point L10112-3(lines 10101 10113) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|)) [2021-11-01 10:31:21,622 INFO L854 garLoopResultBuilder]: At program point L10112(lines 10101 10113) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0))) (.cse1 (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|))) (.cse2 (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|))) (.cse3 (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse4 (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1)) (.cse5 (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse6 (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|))) (.cse7 (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0))) (.cse8 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|)) (.cse9 (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) .cse6 .cse7 .cse8 .cse9 (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)))) [2021-11-01 10:31:21,622 INFO L854 garLoopResultBuilder]: At program point L10112-1(lines 10101 10113) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|)) [2021-11-01 10:31:21,622 INFO L854 garLoopResultBuilder]: At program point L10112-2(lines 10101 10113) the Hoare annotation is: (let ((.cse1 (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0)) (.cse0 (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0))) (.cse2 (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse3 (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (.cse4 (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0))) (.cse5 (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256)))) (.cse6 (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) .cse1 .cse2 .cse3 .cse4 .cse6) (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) .cse0 .cse2 .cse3 (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) .cse4 .cse5 (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) .cse6 (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)))) [2021-11-01 10:31:21,622 INFO L858 garLoopResultBuilder]: For program point L6809-1(lines 6809 6819) no Hoare annotation was computed. [2021-11-01 10:31:21,622 INFO L858 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-11-01 10:31:21,622 INFO L858 garLoopResultBuilder]: For program point L10114(lines 10114 10152) no Hoare annotation was computed. [2021-11-01 10:31:21,622 INFO L858 garLoopResultBuilder]: For program point L10148(lines 10148 10151) no Hoare annotation was computed. [2021-11-01 10:31:21,622 INFO L854 garLoopResultBuilder]: At program point L2617-1(lines 2613 2621) the Hoare annotation is: false [2021-11-01 10:31:21,622 INFO L854 garLoopResultBuilder]: At program point L2617(lines 2613 2621) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,622 INFO L854 garLoopResultBuilder]: At program point L2617-3(lines 2613 2621) the Hoare annotation is: false [2021-11-01 10:31:21,622 INFO L854 garLoopResultBuilder]: At program point L2617-2(lines 2613 2621) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,622 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 10:31:21,622 INFO L854 garLoopResultBuilder]: At program point L6947-1(lines 6943 6948) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,622 INFO L854 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (= (select (store |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| 0) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,622 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:31:21,622 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:31:21,622 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L210-9(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L210-10(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L210-11(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L210-12(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L210-13(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L861 garLoopResultBuilder]: At program point L10153(line 10153) the Hoare annotation is: true [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L210-14(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-11-01 10:31:21,623 INFO L858 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-11-01 10:31:21,624 INFO L858 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-11-01 10:31:21,624 INFO L858 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-11-01 10:31:21,624 INFO L854 garLoopResultBuilder]: At program point L2590(lines 2586 2594) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,624 INFO L858 garLoopResultBuilder]: For program point L211-20(line 211) no Hoare annotation was computed. [2021-11-01 10:31:21,624 INFO L854 garLoopResultBuilder]: At program point L2590-2(lines 2586 2594) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,624 INFO L858 garLoopResultBuilder]: For program point L211-22(line 211) no Hoare annotation was computed. [2021-11-01 10:31:21,624 INFO L854 garLoopResultBuilder]: At program point L2590-1(lines 2586 2594) the Hoare annotation is: false [2021-11-01 10:31:21,624 INFO L858 garLoopResultBuilder]: For program point L211-24(line 211) no Hoare annotation was computed. [2021-11-01 10:31:21,624 INFO L854 garLoopResultBuilder]: At program point L2590-3(lines 2586 2594) the Hoare annotation is: false [2021-11-01 10:31:21,624 INFO L858 garLoopResultBuilder]: For program point L211-26(line 211) no Hoare annotation was computed. [2021-11-01 10:31:21,624 INFO L858 garLoopResultBuilder]: For program point L211-28(line 211) no Hoare annotation was computed. [2021-11-01 10:31:21,624 INFO L858 garLoopResultBuilder]: For program point L9990-2(line 9990) no Hoare annotation was computed. [2021-11-01 10:31:21,624 INFO L858 garLoopResultBuilder]: For program point L9990-3(line 9990) no Hoare annotation was computed. [2021-11-01 10:31:21,624 INFO L858 garLoopResultBuilder]: For program point L9990(line 9990) no Hoare annotation was computed. [2021-11-01 10:31:21,624 INFO L858 garLoopResultBuilder]: For program point L9990-9(line 9990) no Hoare annotation was computed. [2021-11-01 10:31:21,624 INFO L858 garLoopResultBuilder]: For program point L9990-10(line 9990) no Hoare annotation was computed. [2021-11-01 10:31:21,624 INFO L858 garLoopResultBuilder]: For program point L9990-12(line 9990) no Hoare annotation was computed. [2021-11-01 10:31:21,624 INFO L858 garLoopResultBuilder]: For program point L9990-5(line 9990) no Hoare annotation was computed. [2021-11-01 10:31:21,624 INFO L854 garLoopResultBuilder]: At program point L9990-6(lines 9988 9991) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|))) (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= .cse0 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ (select (select |#memory_int| .cse0) 40) 1) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0))) [2021-11-01 10:31:21,625 INFO L858 garLoopResultBuilder]: For program point L9990-7(line 9990) no Hoare annotation was computed. [2021-11-01 10:31:21,625 INFO L858 garLoopResultBuilder]: For program point L9990-17(line 9990) no Hoare annotation was computed. [2021-11-01 10:31:21,625 INFO L858 garLoopResultBuilder]: For program point L9990-19(line 9990) no Hoare annotation was computed. [2021-11-01 10:31:21,625 INFO L854 garLoopResultBuilder]: At program point L9990-20(lines 9988 9991) the Hoare annotation is: false [2021-11-01 10:31:21,625 INFO L854 garLoopResultBuilder]: At program point L9990-13(lines 9988 9991) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset|)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset|))) (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset .cse0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (<= (+ (select (select |#memory_int| .cse1) (+ 40 .cse0)) 1) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.offset) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (= .cse1 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (< (+ .cse1 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|))) [2021-11-01 10:31:21,625 INFO L858 garLoopResultBuilder]: For program point L9990-14(line 9990) no Hoare annotation was computed. [2021-11-01 10:31:21,625 INFO L858 garLoopResultBuilder]: For program point L9990-16(line 9990) no Hoare annotation was computed. [2021-11-01 10:31:21,625 INFO L858 garLoopResultBuilder]: For program point L9990-26(line 9990) no Hoare annotation was computed. [2021-11-01 10:31:21,625 INFO L854 garLoopResultBuilder]: At program point L9990-27(lines 9988 9991) the Hoare annotation is: false [2021-11-01 10:31:21,625 INFO L858 garLoopResultBuilder]: For program point L9990-21(line 9990) no Hoare annotation was computed. [2021-11-01 10:31:21,625 INFO L858 garLoopResultBuilder]: For program point L9990-23(line 9990) no Hoare annotation was computed. [2021-11-01 10:31:21,625 INFO L858 garLoopResultBuilder]: For program point L9990-24(line 9990) no Hoare annotation was computed. [2021-11-01 10:31:21,625 INFO L854 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,625 INFO L854 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,625 INFO L854 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: false [2021-11-01 10:31:21,625 INFO L854 garLoopResultBuilder]: At program point L1998-3(lines 1988 1999) the Hoare annotation is: false [2021-11-01 10:31:21,625 INFO L854 garLoopResultBuilder]: At program point L1998-4(lines 1988 1999) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,625 INFO L854 garLoopResultBuilder]: At program point L1998-5(lines 1988 1999) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,626 INFO L854 garLoopResultBuilder]: At program point L1998-6(lines 1988 1999) the Hoare annotation is: false [2021-11-01 10:31:21,626 INFO L854 garLoopResultBuilder]: At program point L1998-7(lines 1988 1999) the Hoare annotation is: false [2021-11-01 10:31:21,626 INFO L854 garLoopResultBuilder]: At program point L250(lines 248 251) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,626 INFO L854 garLoopResultBuilder]: At program point L250-1(lines 248 251) the Hoare annotation is: false [2021-11-01 10:31:21,626 INFO L858 garLoopResultBuilder]: For program point L7385-3(lines 7385 7387) no Hoare annotation was computed. [2021-11-01 10:31:21,626 INFO L858 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-11-01 10:31:21,626 INFO L854 garLoopResultBuilder]: At program point L250-2(lines 248 251) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,626 INFO L858 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-11-01 10:31:21,626 INFO L854 garLoopResultBuilder]: At program point L250-3(lines 248 251) the Hoare annotation is: false [2021-11-01 10:31:21,626 INFO L858 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-11-01 10:31:21,626 INFO L858 garLoopResultBuilder]: For program point L7385-7(lines 7385 7387) no Hoare annotation was computed. [2021-11-01 10:31:21,626 INFO L858 garLoopResultBuilder]: For program point L7385-6(lines 7385 7387) no Hoare annotation was computed. [2021-11-01 10:31:21,626 INFO L858 garLoopResultBuilder]: For program point L7385-5(lines 7385 7387) no Hoare annotation was computed. [2021-11-01 10:31:21,626 INFO L858 garLoopResultBuilder]: For program point L7385-4(lines 7385 7387) no Hoare annotation was computed. [2021-11-01 10:31:21,626 INFO L858 garLoopResultBuilder]: For program point L10127(lines 10127 10133) no Hoare annotation was computed. [2021-11-01 10:31:21,626 INFO L858 garLoopResultBuilder]: For program point L10127-1(lines 10114 10152) no Hoare annotation was computed. [2021-11-01 10:31:21,626 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-01 10:31:21,626 INFO L854 garLoopResultBuilder]: At program point L2630(lines 2626 2631) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,626 INFO L854 garLoopResultBuilder]: At program point L2630-2(lines 2626 2631) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,627 INFO L854 garLoopResultBuilder]: At program point L2630-1(lines 2626 2631) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|))) (and |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= .cse0 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ (select (select |#memory_int| .cse0) 40) 1) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0))) [2021-11-01 10:31:21,627 INFO L858 garLoopResultBuilder]: For program point L2498(lines 2498 2499) no Hoare annotation was computed. [2021-11-01 10:31:21,627 INFO L854 garLoopResultBuilder]: At program point L2630-4(lines 2626 2631) the Hoare annotation is: false [2021-11-01 10:31:21,627 INFO L854 garLoopResultBuilder]: At program point L2630-3(lines 2626 2631) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset|)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset|))) (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset .cse0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) |ULTIMATE.start_aws_hash_table_is_valid_#t~short1475| |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (<= (+ (select (select |#memory_int| .cse1) (+ 40 .cse0)) 1) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.offset) (= .cse1 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) ULTIMATE.start_aws_hash_table_is_valid_~map.offset) 0)) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (= ULTIMATE.start_aws_hash_table_is_valid_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (< (+ .cse1 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|))) [2021-11-01 10:31:21,629 INFO L858 garLoopResultBuilder]: For program point L2498-2(lines 2498 2499) no Hoare annotation was computed. [2021-11-01 10:31:21,629 INFO L858 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2021-11-01 10:31:21,629 INFO L854 garLoopResultBuilder]: At program point L2630-5(lines 2626 2631) the Hoare annotation is: false [2021-11-01 10:31:21,629 INFO L858 garLoopResultBuilder]: For program point L2498-3(lines 2498 2499) no Hoare annotation was computed. [2021-11-01 10:31:21,630 INFO L854 garLoopResultBuilder]: At program point L2501-1(lines 2497 2502) the Hoare annotation is: false [2021-11-01 10:31:21,630 INFO L854 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,630 INFO L854 garLoopResultBuilder]: At program point L2501-3(lines 2497 2502) the Hoare annotation is: false [2021-11-01 10:31:21,630 INFO L854 garLoopResultBuilder]: At program point L2501-2(lines 2497 2502) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,630 INFO L854 garLoopResultBuilder]: At program point L255(lines 253 256) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,630 INFO L854 garLoopResultBuilder]: At program point L255-1(lines 253 256) the Hoare annotation is: false [2021-11-01 10:31:21,630 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-01 10:31:21,630 INFO L854 garLoopResultBuilder]: At program point L255-2(lines 253 256) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,630 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-01 10:31:21,630 INFO L854 garLoopResultBuilder]: At program point L255-3(lines 253 256) the Hoare annotation is: false [2021-11-01 10:31:21,630 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-01 10:31:21,630 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-01 10:31:21,630 INFO L858 garLoopResultBuilder]: For program point L9273(lines 10144 10147) no Hoare annotation was computed. [2021-11-01 10:31:21,630 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-01 10:31:21,630 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-01 10:31:21,630 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L10001(lines 10001 10005) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L10001-1(lines 10001 10005) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L10001-2(lines 10001 10005) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L10001-3(lines 10001 10005) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L7195-1(lines 7195 7201) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L7195(lines 7195 7201) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L10135(lines 10135 10141) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L7196-2(lines 7196 7200) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L7196(lines 7196 7200) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L10104-3(lines 10104 10106) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L10104(lines 10104 10106) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L10104-1(lines 10104 10106) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L10104-2(lines 10104 10106) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L2542(lines 2542 2543) no Hoare annotation was computed. [2021-11-01 10:31:21,631 INFO L858 garLoopResultBuilder]: For program point L2542-2(lines 2542 2543) no Hoare annotation was computed. [2021-11-01 10:31:21,632 INFO L858 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2021-11-01 10:31:21,632 INFO L858 garLoopResultBuilder]: For program point L2542-3(lines 2542 2543) no Hoare annotation was computed. [2021-11-01 10:31:21,632 INFO L854 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: false [2021-11-01 10:31:21,632 INFO L854 garLoopResultBuilder]: At program point L263-1(line 263) the Hoare annotation is: false [2021-11-01 10:31:21,632 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-01 10:31:21,632 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 10:31:21,632 INFO L858 garLoopResultBuilder]: For program point L10108(lines 10108 10110) no Hoare annotation was computed. [2021-11-01 10:31:21,632 INFO L858 garLoopResultBuilder]: For program point L10108-1(lines 10108 10110) no Hoare annotation was computed. [2021-11-01 10:31:21,632 INFO L858 garLoopResultBuilder]: For program point L10108-2(lines 10108 10110) no Hoare annotation was computed. [2021-11-01 10:31:21,632 INFO L858 garLoopResultBuilder]: For program point L10108-3(lines 10108 10110) no Hoare annotation was computed. [2021-11-01 10:31:21,632 INFO L854 garLoopResultBuilder]: At program point L2545-1(lines 2541 2546) the Hoare annotation is: false [2021-11-01 10:31:21,632 INFO L854 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,632 INFO L854 garLoopResultBuilder]: At program point L2545-3(lines 2541 2546) the Hoare annotation is: false [2021-11-01 10:31:21,632 INFO L854 garLoopResultBuilder]: At program point L2545-2(lines 2541 2546) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,632 INFO L854 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,632 INFO L854 garLoopResultBuilder]: At program point L266-1(line 266) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| 0)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#stored_byte_a~0.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) 1) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= ULTIMATE.start_ensure_allocated_hash_table_~map.base |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base| |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base|)) (not (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.base|) (= ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 (* 256 (div ULTIMATE.start_aws_hash_table_swap_harness_~inita~0 256))) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| 0) (= |ULTIMATE.start_aws_hash_table_swap_harness_~#b~8.offset| |ULTIMATE.start_aws_hash_table_swap_harness_~#a~5.offset|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0)) [2021-11-01 10:31:21,635 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:31:21,645 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-01 10:31:21,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:21,657 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,657 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:21,658 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,658 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,658 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:21,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:21,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,660 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,660 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:21,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,664 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,664 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:21,664 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,664 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:21,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:21,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:21,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:21,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,672 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,672 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:21,672 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,672 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:21,673 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,673 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,673 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,674 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:21,674 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,674 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:21,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:21,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:21,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,678 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,678 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:21,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:21,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:21,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 10:31:21 BoogieIcfgContainer [2021-11-01 10:31:21,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-01 10:31:21,682 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-01 10:31:21,682 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-01 10:31:21,682 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-01 10:31:21,683 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 10:29:20" (3/4) ... [2021-11-01 10:31:21,685 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-01 10:31:21,702 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 238 nodes and edges [2021-11-01 10:31:21,704 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 93 nodes and edges [2021-11-01 10:31:21,705 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-11-01 10:31:21,706 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-11-01 10:31:21,707 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-01 10:31:21,708 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-01 10:31:21,709 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-01 10:31:21,710 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-01 10:31:21,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(a == 0) && !(a == stored_byte_a)) && !(a == required_bytes)) && \result + 1 <= 0) && a == map) && \valid[a] == 1) && a == map) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) || ((((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0) [2021-11-01 10:31:21,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(a == 0) && \result + 1 <= 0) && b == map) && map == b) && !(b == 0)) && inita == 256 * (inita / 256)) && b == a) || ((((((!(a == 0) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && b == map) && map == b) && !(b == 0)) && b == a)) || ((((((((((unknown-#StackHeapBarrier-unknown < b && unknown-#StackHeapBarrier-unknown < a) && !(a == 0)) && b == map) && map == b) && num_entries + 1 <= 0) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0) [2021-11-01 10:31:21,729 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && \result == 0) && !(\result == 0)) && a == map) && \result + 1 < a) && a == map) && num_entries + 1 <= 0) && !(a == b)) && \valid[required_bytes := 0][a] == 1) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 [2021-11-01 10:31:21,729 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((unknown-#StackHeapBarrier-unknown < b && unknown-#StackHeapBarrier-unknown < a) && !(a == 0)) && !(\result == 0)) && b == map) && \result + 1 < b) && map == b) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 [2021-11-01 10:31:21,729 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux && a == 0) && !(a == 0)) && !(a == stored_byte_a)) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[a][a] + 1 < a) && a == map) && a == map) && map == a) && #memory_$Pointer$[map][map] == 0) && \valid[a] == 1) && map == 0) && \result == 0) && \result + 1 < a) && a == map) && #memory_$Pointer$[a][a] == map) && size_at_least_two == 0) && num_entries + 1 <= 0) && !(a == b)) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[a][a]][40] + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= a) && !(map == 0)) && b == a) && max_table_entries + 1 <= 0 [2021-11-01 10:31:21,730 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[a][a] + 1 < a) && a == map) && a == map) && \result == 0) && map == a) && #memory_$Pointer$[map][map] == 0) && \valid[a] == 1) && map == 0) && \result == 0) && \result + 1 < a) && a == map) && #memory_$Pointer$[a][a] == map) && size_at_least_two == 0) && num_entries + 1 <= 0) && !(a == b)) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[a][a]][40] + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= a) && !(map == 0)) && b == a) && max_table_entries + 1 <= 0 [2021-11-01 10:31:21,730 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < b && map == #memory_$Pointer$[b][b]) && unknown-#StackHeapBarrier-unknown < a) && aux-map && map->p_impl-aux) && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && !(a == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[b][b]][40 + #memory_$Pointer$[b][b]] + 1 <= 0) && !(\result == 0)) && b == map) && #memory_$Pointer$[b][b] == map) && \result == 0) && b == map) && \result + 1 < b) && map == b) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0) && map == b) && #memory_$Pointer$[b][b] + 1 < b [2021-11-01 10:31:21,730 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < b && map == #memory_$Pointer$[b][b]) && unknown-#StackHeapBarrier-unknown < a) && !(a == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[b][b]][40 + #memory_$Pointer$[b][b]] + 1 <= 0) && !(\result == 0)) && b == map) && \result == 0) && #memory_$Pointer$[b][b] == map) && \result == 0) && b == map) && \result + 1 < b) && map == b) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0) && map == b) && #memory_$Pointer$[b][b] + 1 < b [2021-11-01 10:31:21,730 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux && a == 0) && !(a == 0)) && !(a == stored_byte_a)) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[a][a] + 1 < a) && a == map) && a == map) && map == a) && #memory_$Pointer$[map][map] == 0) && \valid[a] == 1) && map == 0) && \result + 1 < a) && a == map) && #memory_$Pointer$[a][a] == map) && size_at_least_two == 0) && num_entries + 1 <= 0) && !(a == b)) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[a][a]][40] + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= a) && !(map == 0)) && b == a) && max_table_entries + 1 <= 0 [2021-11-01 10:31:21,730 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < b && map == #memory_$Pointer$[b][b]) && unknown-#StackHeapBarrier-unknown < a) && aux-map && map->p_impl-aux) && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && !(a == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[b][b]][40 + #memory_$Pointer$[b][b]] + 1 <= 0) && !(\result == 0)) && b == map) && #memory_$Pointer$[b][b] == map) && b == map) && \result + 1 < b) && map == b) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0) && map == b) && #memory_$Pointer$[b][b] + 1 < b [2021-11-01 10:31:21,730 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(a == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && a == map) && a == map) && !(b == 0)) && b == a [2021-11-01 10:31:21,731 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(a == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && b == map) && map == b) && !(b == 0)) && b == a [2021-11-01 10:31:22,246 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-01 10:31:22,247 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-01 10:31:22,247 INFO L158 Benchmark]: Toolchain (without parser) took 128830.21ms. Allocated memory was 104.9MB in the beginning and 520.1MB in the end (delta: 415.2MB). Free memory was 65.7MB in the beginning and 133.0MB in the end (delta: -67.3MB). Peak memory consumption was 356.1MB. Max. memory is 16.1GB. [2021-11-01 10:31:22,248 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 104.9MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-01 10:31:22,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2408.95ms. Allocated memory was 104.9MB in the beginning and 178.3MB in the end (delta: 73.4MB). Free memory was 65.5MB in the beginning and 98.9MB in the end (delta: -33.5MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2021-11-01 10:31:22,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 201.62ms. Allocated memory is still 178.3MB. Free memory was 98.9MB in the beginning and 84.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-01 10:31:22,248 INFO L158 Benchmark]: Boogie Preprocessor took 88.71ms. Allocated memory is still 178.3MB. Free memory was 84.2MB in the beginning and 74.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-01 10:31:22,248 INFO L158 Benchmark]: RCFGBuilder took 4291.15ms. Allocated memory was 178.3MB in the beginning and 432.0MB in the end (delta: 253.8MB). Free memory was 74.8MB in the beginning and 122.2MB in the end (delta: -47.4MB). Peak memory consumption was 224.6MB. Max. memory is 16.1GB. [2021-11-01 10:31:22,249 INFO L158 Benchmark]: TraceAbstraction took 121269.21ms. Allocated memory was 432.0MB in the beginning and 520.1MB in the end (delta: 88.1MB). Free memory was 122.2MB in the beginning and 302.4MB in the end (delta: -180.2MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2021-11-01 10:31:22,249 INFO L158 Benchmark]: Witness Printer took 564.70ms. Allocated memory is still 520.1MB. Free memory was 302.4MB in the beginning and 133.0MB in the end (delta: 169.4MB). Peak memory consumption was 178.8MB. Max. memory is 16.1GB. [2021-11-01 10:31:22,250 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.23ms. Allocated memory is still 104.9MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2408.95ms. Allocated memory was 104.9MB in the beginning and 178.3MB in the end (delta: 73.4MB). Free memory was 65.5MB in the beginning and 98.9MB in the end (delta: -33.5MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 201.62ms. Allocated memory is still 178.3MB. Free memory was 98.9MB in the beginning and 84.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.71ms. Allocated memory is still 178.3MB. Free memory was 84.2MB in the beginning and 74.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 4291.15ms. Allocated memory was 178.3MB in the beginning and 432.0MB in the end (delta: 253.8MB). Free memory was 74.8MB in the beginning and 122.2MB in the end (delta: -47.4MB). Peak memory consumption was 224.6MB. Max. memory is 16.1GB. * TraceAbstraction took 121269.21ms. Allocated memory was 432.0MB in the beginning and 520.1MB in the end (delta: 88.1MB). Free memory was 122.2MB in the beginning and 302.4MB in the end (delta: -180.2MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. * Witness Printer took 564.70ms. Allocated memory is still 520.1MB. Free memory was 302.4MB in the beginning and 133.0MB in the end (delta: 169.4MB). Peak memory consumption was 178.8MB. 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$.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$.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$.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$.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$.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$.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 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$.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 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$.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 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$.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 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$.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$.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 * 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 164 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 121181.10ms, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 26.90ms, AutomataDifference: 96014.99ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 8516.64ms, InitialAbstractionConstructionTime: 9.42ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 2622 SdHoareTripleChecker+Valid, 83557.90ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2622 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 75652.99ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7906 mSDsCounter, 215 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13020 IncrementalHoareTripleChecker+Invalid, 13249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 215 mSolverCounterUnsat, 0 mSDtfsCounter, 13020 mSolverCounterSat, 187.55ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 15942.79ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=323occurred in iteration=11, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 222.65ms AutomataMinimizationTime, 14 MinimizatonAttempts, 380 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 57 LocationsWithAnnotation, 57 PreInvPairs, 96 NumberOfFragments, 2315 HoareAnnotationTreeSize, 57 FomulaSimplifications, 1320 FormulaSimplificationTreeSizeReduction, 105.59ms HoareSimplificationTime, 57 FomulaSimplificationsInter, 307 FormulaSimplificationTreeSizeReductionInter, 8394.32ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 441.11ms SsaConstructionTime, 3410.57ms SatisfiabilityAnalysisTime, 11081.62ms InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 658 ConstructedInterpolants, 0 QuantifiedInterpolants, 4171 SizeOfPredicates, 87 NumberOfNonLiveVariables, 7961 ConjunctsInSsa, 177 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 4 specifications checked. All of them hold - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[elemsize := 0][a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[elemsize := 0][a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: ((((((!(a == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && b == map) && map == b) && !(b == 0)) && b == a - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant [2021-11-01 10:31:22,264 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:22,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:22,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:22,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:22,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < b && map == #memory_$Pointer$[b][b]) && unknown-#StackHeapBarrier-unknown < a) && aux-map && map->p_impl-aux) && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && !(a == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[b][b]][40 + #memory_$Pointer$[b][b]] + 1 <= 0) && !(\result == 0)) && b == map) && #memory_$Pointer$[b][b] == map) && b == map) && \result + 1 < b) && map == b) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0) && map == b) && #memory_$Pointer$[b][b] + 1 < b - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && a == map) && \valid[a] == 1) && a == map) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[elemsize := 0][a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[elemsize := 0][a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 2626]: Loop Invariant [2021-11-01 10:31:22,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:22,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,269 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:22,270 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,270 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux && a == 0) && !(a == 0)) && !(a == stored_byte_a)) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[a][a] + 1 < a) && a == map) && a == map) && map == a) && #memory_$Pointer$[map][map] == 0) && \valid[a] == 1) && map == 0) && \result + 1 < a) && a == map) && #memory_$Pointer$[a][a] == map) && size_at_least_two == 0) && num_entries + 1 <= 0) && !(a == b)) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[a][a]][40] + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= a) && !(map == 0)) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[elemsize := 0][a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant [2021-11-01 10:31:22,271 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,271 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:22,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:22,272 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,273 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux && a == 0) && !(a == 0)) && !(a == stored_byte_a)) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[a][a] + 1 < a) && a == map) && a == map) && map == a) && #memory_$Pointer$[map][map] == 0) && \valid[a] == 1) && map == 0) && \result == 0) && \result + 1 < a) && a == map) && #memory_$Pointer$[a][a] == map) && size_at_least_two == 0) && num_entries + 1 <= 0) && !(a == b)) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[a][a]][40] + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= a) && !(map == 0)) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[elemsize := 0][a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#StackHeapBarrier-unknown < b && unknown-#StackHeapBarrier-unknown < a) && !(a == 0)) && !(\result == 0)) && b == map) && \result + 1 < b) && map == b) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && a == map) && \valid[a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant [2021-11-01 10:31:22,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:22,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:22,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:22,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:22,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < b && map == #memory_$Pointer$[b][b]) && unknown-#StackHeapBarrier-unknown < a) && aux-map && map->p_impl-aux) && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && !(a == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[b][b]][40 + #memory_$Pointer$[b][b]] + 1 <= 0) && !(\result == 0)) && b == map) && #memory_$Pointer$[b][b] == map) && \result == 0) && b == map) && \result + 1 < b) && map == b) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0) && map == b) && #memory_$Pointer$[b][b] + 1 < b - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 10153]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 9988]: Loop Invariant [2021-11-01 10:31:22,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:22,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:22,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:22,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:22,282 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,282 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,282 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((unknown-#StackHeapBarrier-unknown < b && map == #memory_$Pointer$[b][b]) && unknown-#StackHeapBarrier-unknown < a) && !(a == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[b][b]][40 + #memory_$Pointer$[b][b]] + 1 <= 0) && !(\result == 0)) && b == map) && \result == 0) && #memory_$Pointer$[b][b] == map) && \result == 0) && b == map) && \result + 1 < b) && map == b) && size_at_least_two == 0) && !(#memory_$Pointer$[map][map] == 0)) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0) && map == b) && #memory_$Pointer$[b][b] + 1 < b - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: (((((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && num_entries + 1 <= 0) && !(a == b)) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[elemsize := 0][a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: ((((((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && \result == 0) && !(\result == 0)) && a == map) && \result + 1 < a) && a == map) && num_entries + 1 <= 0) && !(a == b)) && \valid[required_bytes := 0][a] == 1) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#StackHeapBarrier-unknown < b && !(a == 0)) && !(a == stored_byte_a)) && \valid[a] == 1) && b == map) && map == b) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 9988]: Loop Invariant [2021-11-01 10:31:22,285 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,285 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:22,285 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:31:22,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:31:22,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && \result == 0) && !(\result == 0)) && #memory_$Pointer$[a][a] + 1 < a) && a == map) && a == map) && \result == 0) && map == a) && #memory_$Pointer$[map][map] == 0) && \valid[a] == 1) && map == 0) && \result == 0) && \result + 1 < a) && a == map) && #memory_$Pointer$[a][a] == map) && size_at_least_two == 0) && num_entries + 1 <= 0) && !(a == b)) && (cond == 1 || cond == 0)) && !(b == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[a][a]][40] + 1 <= 0) && unknown-#StackHeapBarrier-unknown + 1 <= a) && !(map == 0)) && b == a) && max_table_entries + 1 <= 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: ((((((!(a == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && a == map) && a == map) && !(b == 0)) && b == a - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: ((((((((((!(a == 0) && !(a == stored_byte_a)) && !(a == required_bytes)) && \result + 1 <= 0) && a == map) && \valid[a] == 1) && a == map) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) || ((((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0) - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: (((((((!(a == 0) && \result + 1 <= 0) && b == map) && map == b) && !(b == 0)) && inita == 256 * (inita / 256)) && b == a) || ((((((!(a == 0) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && b == map) && map == b) && !(b == 0)) && b == a)) || ((((((((((unknown-#StackHeapBarrier-unknown < b && unknown-#StackHeapBarrier-unknown < a) && !(a == 0)) && b == map) && map == b) && num_entries + 1 <= 0) && !(b == 0)) && inita == 256 * (inita / 256)) && b == 0) && b == a) && max_table_entries + 1 <= 0) - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: (((((((((((a == 0 && !(a == 0)) && !(a == stored_byte_a)) && !(a == required_bytes)) && a == map) && \valid[elemsize := 0][a] == 1) && a == map) && num_entries + 1 <= 0) && !(a == b)) && !(b == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= a) && b == a) && max_table_entries + 1 <= 0 RESULT: Ultimate proved your program to be correct! [2021-11-01 10:31:22,491 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-01 10:31:22,527 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 137 Received shutdown request...